MACM
101: Discrete Mathematics (Fall 2011)
Classroom: Surrey 2600
Instructor: Binay Bhattacharya Office: 4136, e-mail: binay@cs.sfu.ca, phone: (778)782-3133/778-782/8639
Office hours (Binay): M 12:00 noon-1:00pm WF 10:30-1:00.
Office hours (Binay) (Exam day) : 10am-1pm.
TA:Shklarsky (Oren) Office: 4064, e-mail: Oren Shklarsky
TA:Gupta (Ankit) Office: 4064, e-mail: Ankit Gupta
Office hours (TA): MW 4:30pm - 5:30pm and Tuesday 1pm - 1:30pm and 3pm - 3:30pm
Messages/Hand-outs
13:30-11:20, Monday, Wednesday, Friday
Week |
Date |
Topics |
Reference |
1 |
|||
07/09 | Course Organization | ||
09/09 | Rule of Sum and Product; Permutation | Text sections 1.1 and 1.2 | |
2 |
12/09 | Permutation (contd.) | |
14/09 | Combinations, Binomial Theorem | Text section 1.3 | |
16/09 | Combinations with repetition | Text section 1.4 | |
3 |
19/09 | Problems from Chapter 1 | |
21/09 | Problems from Chapter 1 | ||
23/09 | Quiz #1 | ||
4 |
26/09 | Fundamentals of Logic | Section 2.1 |
28/09 | Logical Eqivalence | Section 2.2 | |
30/09 | The Use of Quatifiers | Section 2.4 | |
5 |
03/10 | Section 2.4 | |
05/10 | Rules of Inference | Section 2.3 | |
07/10 | Practice Problems | ||
6 |
10/10 | No Lecture | |
12/10 | Quiz #2 | ||
14/10 | Set Theory | Section 3.1, 3.2, 3.3 | |
7 |
17/10 | Set Theory (contd.) | |
19/10 | A First Word on Probability | Section 3.4 | |
21/10 | Probabilty (contd.) | ||
8 |
24/10 | Proofs and Induction | Sections 2.6 and 4.1 |
26/10 | Proofs and Induction (contd.) | ||
28/10 | Proofs and Induction (contd.) | ||
9 |
31/10 | Proofs and Induction (contd.) | Sections 2.6 and 4.1 |
02/11 | Quiz 3 | Exercises Covered: 2.5, 3.1, 3.2, 3.3, 3.4, 4.1 | |
04/11 | Relations and Functions | Chapter 5 (Sections 5.1, 5.2, 5.3, 5.6) | |
10 |
07/11 | Relations and Functions(contd.) | Sections 5.1, 5.2 |
09/11 | Functions | Covered: 5.3 | |
11/11 | Functions | Sections 5.6 | |
11 |
14/11 | Finished Functions | |
16/11 | Pigeonhole principle | 5.5 | |
18/11 | Quiz 4 | Sections covered 5.1, 5.2, 5.3, 5.6 |
12 |
21/11 | More on Relations (Chapter 7) |
23/11 | Equivalence Relations | Section 7.4 | |
25/11 | Partial Orders | Section 7.3 |
13 |
28/11 | More on Partial Orders and Equivalence Relations | Chapter 7 |
30/11 | Induction Revisited; Recursive Definitions | Section 4.1, 4.2 | |
2/12 | Quiz 5 | Section 5.5, 7.1, 7.3, 7.4 |
13 |
5/12 | Division Algorithm: Prime Numbers; Fundamental Theorem of Arithmetic | Section 4.3, 4.5 |