Syllabus
| WEEK | DATES | TOPICS |
|---|---|---|
| 1 | 04 - 08 October |
Counting - I |
| 2 | 11 - 15 October |
Counting - II |
| 3 | 18 - 22 October |
Propositional Logic |
| 4 | 25 - 29 October |
Proofs, Mathematical Induction |
| 5 | 01 - 05 November |
Prime Numbers, Integers, Modular Aritmetic |
| 6 | 08 - 12 November |
Set Theory, Relations, Functions |
| 7 | 15 - 19 November |
Pigeonhole Principle |
| 8 | 22 - 26 November |
Graph theory |
| 9 | 29 Nov. - 03 Dec. |
Paths and Cycles |
| 10 | 06 - 10 December |
Trees |
| 11 | 13 - 17 December |
Computational Complexity |
| 12 | 20 - 24 December |
Recursion and Recurrence Relations |
| 13 | 27 - 31 December |
Recurrence Relations and Algorithms |
| 14 | 03 - 07 January |
Finite State Machines |