Math Bridging Course Tutorial 1 Chris TC Wong 16/8/2012 19:00 – 20:00 19/8/2012 16:30 – 17:30.

Slides:



Advertisements
Similar presentations
Common Core Mathematical Practices. People who are good in math… Make sense of problems.
Advertisements

Partitioning and Divide-and-Conquer Strategies Data partitioning (or Domain decomposition) Functional decomposition.
Series Brought to you by Tutorial Services – The Math Center.
Divide-and-Conquer Recursive in structure –Divide the problem into several smaller sub-problems that are similar to the original but smaller in size –Conquer.
Introduction to CS170. CS170 has multiple sections Each section has its own class websites URLs for different sections: Section 000:
1 Welcome School of Computing and Mathematical Sciences (CMS)
Lecture 91 Single Node-Pair Circuits and Current Division.
From Chapter 4 Formal Specification using Z David Lightfoot
School of Computing Science CMT1000 © Ed Currie Middlesex University 1 CMT1000: Introduction to Programming Ed Currie Lecture 1B: Problem Solving.
10/22/2004EE 42 fall 2004 lecture 221 Lecture #22 Truth tables and gates This week: Circuits for digital devices.
Propositional Logic Lecture 2: Sep 9. Conditional Statement If p then q p is called the hypothesis; q is called the conclusion “If your GPA is 4.0, then.
Unit 1. Sorting and Divide and Conquer. Lecture 1 Introduction to Algorithm and Sorting.
How to Study Mathematics Effectively?. What is Mathematics? A Language to Explain the Scientific Laws A Language for Expressing the Rational Mind VocabulariesGrammar.
Chapter 11 – Introduction to Algebra (Part II)
4.1 Factors and Divisibility
Propositional Logic.
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
Paragraph Writing Basics 1. The building blocks Main IdeaSupporting IdeaSummary Sentence pargraph writing - MELTCenter publication2.
Discrete Mathematics CS 285. Lecture 12 Section 1.1: Logic Axiomatic concepts in math: Equals Opposite Truth and falsehood Statement Objects Collections.
2002 October 10SFWR ENG 4G030 Translating from English into Mathematics SFWR ENG 4G Robert L. Baber.
COMP 200 Elements of Computer Science COMP 130 Elements of Algorithms & Computation John Greiner Stephen Wong.
CB1004 Modelling Business Systems 71 Modelling Business Systems 7 Systems Methods.
Each Smaller Learning Community has its own counselors. Students have been assigned to a smaller learning community. If you are unsure of who your counselor.
Methods of Proof. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical theorems. Direct.
Variables and Equations Pre-Algebra. Learning Objective I can solve equations with variables.
Numeracy and Mathematics P5, P6 and P7. Number and number processes Having determined which calculations are needed, I can solve problems involving whole.
259 Lecture 6 Spring 2013 Recurrence Relations in Excel.
Dual Enrollment Info! Before the student may register for a DE class, YOU MUST: 1. Create their "my.maricopa" account 2. Apply for Admissions (wait 20.
Analysis of Algorithms
Thinking Mathematically Logic 3.2 Compound Statements and Connectives.
Methods of Proofs PREDICATE LOGIC The “Quantifiers” and are known as predicate quantifiers. " means for all and means there exists. Example 1: If we.
ECE 8443 – Pattern Recognition EE 3512 – Signals: Continuous and Discrete Objectives: Convolution Definition Graphical Convolution Examples Properties.
Methods of Proof Lecture 3: Sep 9. This Lecture Now we have learnt the basics in logic. We are going to apply the logical rules in proving mathematical.
MATHS 102 Mathematics 2 Module 0 Models & Functions Lecture 1 Welcome to Mathematics.
Algorithms CS139 – Aug 30, Problem Solving Your roommate, who is taking CS139, is in a panic. He is worried that he might lose his financial aid.
DIVISIBILITY RULES.
(2-2) Functions I H&K Chapter 3 Instructor - Andrew S. O’Fallon CptS 121 (Spetember 9, 2015) Washington State University.
Representation of CT Signals (Review)
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
Discrete Mathematics CS 285. Lecture 12 Quick Overview The conceptual center of computer science is the ALGORITHM.
Nonvisual Arrays by Chris Brown under Prof. Susan Rodger Duke University June 2012.
Beginning of the Year Math Review Houghton Mifflin ©2005.
Thinking Mathematically Statistics: 12.3 Measures of Dispersion.
1 Data Structures CSCI 132, Spring 2014 Lecture 1 Big Ideas in Data Structures Course website:
Ratios. In mathematics a ratio expresses the magnitude of quantities relative to each other. Determine the following ratios Boys to girls staff : students.
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
Divisibility Tests How can you tell quickly whether a number can be divided exactly by another?
Class 1, January 26, 2016 Lesson 5.1: Numbers, Numbers, Everywhere.
Math Bridging Course Tutorial 3 Chris TC Wong 30/8/2012 1/9/2012.
Discrete Mathematics Lecture # 4. Conditional Statements or Implication  If p and q are statement variables, the conditional of q by p is “If p then.
Aids to Formulating and Answering Key Questions NameWhen to use u Construction Methodproving “there exists” u Choose Method proving “for every” u Math.
Lecture 10 Methods of Proof CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
MA/CSSE 473 Day 09 Modular Division Revisited Fermat's Little Theorem Primality Testing.
Methods of Proof Lecture 4: Sep 20 (chapter 3 of the book, except 3.5 and 3.8)
Notions & Notations - 1ICOM 4075 (Fall 2010) UPRM Department of Electrical and Computer Engineering University of Puerto Rico at Mayagüez Fall 2010 ICOM.
Name the property shown by each statement. 1. a + (b + c) = (a + b) + c 2. 3(ab) = (ab)3 3. z + y + 0 = z + y 4. 7 h 0 = 0 5. Dance lessons cost $100 per.
CSE 3358 NOTE SET 2 Data Structures and Algorithms 1.
Algebra Preparing Our Students for Common Core Implementation Athalean Gee.
Propositional Logic.
Unit 1. Sorting and Divide and Conquer
Maths Unit 9 – Forming & Solving Equations
Fractions Welcome to learning all about …
Propositional Logic.
Chapter 11 Limitations of Algorithm Power
LINEAR EQUATIONS.
Computer games rely on game rules being written
LECTURE 07: CONVOLUTION FOR CT SYSTEMS
LINEAR EQUATIONS.
Divisibility Rules Dividing by 2
If v.s. Only If v.s. If and Only If (Iff)
Presentation transcript:

Math Bridging Course Tutorial 1 Chris TC Wong 16/8/ :00 – 20:00 19/8/ :30 – 17:30

What have we learnt after this two lectures Hard Skills – Definition of Limits – Problem Solving Idea : Divide and Conquer – Necessary and Sufficient Condition – Using Maxima as a mathematical tools Soft Skills – How to collaborate with others – How to stay awake in long lectures – How to express abstract idea into mathematical statements

Definition of Limit of Sequence

Definition of Limit of function

Comparison of two definitions

Demonstration to Exercises in Lecture

Necessary and Sufficient Condition If A is required to make B happen (no guarantee), then A is a necessary condition of B E.g. – You must be registered before being a student in university. Registering is a necessary condition for being a student in university. Well, you probably need to pay for the registration fee, too. If A happen alone can make B happen with guarantee, then A is an sufficient condition of B E.g. – You must pass AL and scored better than the cut-off score to be an IE student. ‘pass AL and scored better than the cut-off score’ is a sufficient condition for being an IE student But being an IE student do not necessary means that you have passed AL. You can be a DSE student.

Necessary and Sufficient Condition (Cont.) If A is necessary and sufficient to make B happens, A is a necessary and sufficient condition for B. – E.g. Under normal circumstance, completing circuit between power button and power supply of a computer can turn it on. – E.g. You get a scholarship if and only if you have very high GPA and is truly outstanding. – E.g. Love between a couple brings them to marriage. (?)

If and only if If A happens implies B happens, and B happens implies A happens, then we say A happens if and only if B happens. We says that two things are equivalent under this condition. Some lazy people just write this as “iff” – E.g. A number can be divided by 9 if and only if the sum of its digits can be divided by 9.

End