Lecture and Tutorial Contents

References:

1) Textbook:  Kenneth H. Rosen, Discrete Mathematics and Its Applications, Sixth  Edition, McGraw Hill, 2007.

2) csi2101-2008, class notes by Prof Zaguia.


Lecture and tutorial contents (the future material is tentative; further updates will reflect what was covered) : 

 

1) Jan 8

Intro to Discrete Structures/Review propositional logic.

Ch. 1.1, 1.2
Lecture Notes (LN1, LN1.1)

2) Jan 12

Review of propositional logic.

No Tutorial.

Ch 1.1, 1.2

Lect (L1.2) Exercise (E1)

3) Jan 15

Predicate logic.

Ch 1.3, 1.4
Lect (LN2)

4) Jan 19

Tutorial: 9:00 Propositional logic (Lecture by Prof)

Lecture: Predicate Logic (cont'd).

Lect (LN1.3)
Ch. 1.3, 1.4 (Continue LN2)

5) Jan 22

Review rules of inference and proof methods

Ch 1.5,1.6,1.7 Lect (LN3)

6) Jan 26

Review rules of inference and proof methods
Tutorial: 9:00 Predicate logic exercises

Ch 1.5,1.6,1.7
Continued LN3.

7) Jan 29

Proof methods; induction.

Ch 4.1, 4.2
Lect (LN4)

8) Feb 2

Induction.

Tutorial: 8:30! Proofs/induction.

Ch 4.1, 4.2


9) Feb 5

Strong induction.

Ch 4.2

10) Feb 9

Correctness of recursive programs.
Program correctness and verification.

Tutorial: Induction exercises

Ch 4.4, 4.5
Lect L6

11) Feb 12

Review lecture.

-

Feb 16-20

Study break

-

12) Feb 23

MIDTERM EXAM (starts 9:30)

-

13) Feb 26

Recursive definitions and structural induction.

Ch 4.3 (End of Lect LN4)

14) Mar 2

Growth of functions and complexity of algorithms

Tutorial: Midterm return, midterm solution, quiz.

Ch 3.2, 3.3
end LN4, LN5

15) Mar 5

Basic number theory and applications

Ch 3.4, 3.5, 3.7 (LN6)

16) Mar 9


Basic number theory and applications

Tutorial: Big-Oh, etc - quiz

Ch 3.4, 3.5, 3.7


17) Mar 12

Basic number theory and applications

Ch 3.4, 3.5, 3.7

18) Mar 16


Basic Number theory and applications

Tutorial: Number theory; quiz.

Ch 3.4, 3.5, 3.7 (LN6-revised)


19) Mar 19

Recurrence relations and complexity of algorithms

Ch 7.1, 7.2, 7.3 (LN7)

20) Mar 23


Recurrence relations and complexity of algorithms

Tutorial: euclidean/extended euclidean algor; quiz.

Ch 7.1, 7.2, 7.3


21) Mar 26

Recurrence relations and complexity of algorithms

Ch 7.1, 7.2, 7.3.

22) Mar 30


Recurrence relations & extra Number Theory

Tutorial: Number Theory and RSA cryptosystem; quiz

LN7 + Extra


23) Apr 2

Graphs and trees (selected topics)

Selected from Ch 9,10. LN8

24) Apr 6

Graphs and trees (selected topics)

Tutorial: TBA

Selected from Ch 9,10.


25) Apr 9

Course overview.

-