Programming: C: Source.
1. Kenneth H Rosen (Editor-in-chief), Handbook of Discrete and Combinatorial Mathematics, 2nd Edition, CRC Press.
2. Michel O Albertson and Joan P Hutchinson, Discrete Mathematics with Algorithms, Wiley.
3. Norman L Biggs, Discrete Mathematics, Oxford University Press.
4. Winfried Karl Grassmann and Jean-Paul Tremblay, Logic and Discrete Mathematics, Pearson.
5. Richard Johnsonbaugh, Discrete Mathematics, 8th Edition, Pearson.
6. Bernard Kolman, Robert C Busby, and Sharon Cutler Ross, Discrete Mathematical Structures, 6th Edition, Pearson.
7. Thomas Koshy, Discrete Mathematics with Applications, Elsevier.
8. C L Liu, Elements of Discrete Mathematics, 4th Edition, Tata McGraw-Hill.
9. Ralph P Grimaldi, Discrete and Combinatorial Mathematics, 5th Edition, Pearson, 2004.
10. Cliff L Stein, Robert Drysdale, and Kenneth Bogart, Discrete Mathematics for Computer Scientists, Pearson.
11. Jean-Paul Tremblay and R Manohar, Discrete Mathematical Structures with Applications to Computer Science, Tata McGraw-Hill.
| Week | Topic | Resources | Reading and Assignments |
|---|---|---|---|
| 1 | Introduction, Propositional Logic |
|
|
| 2 | First Order Predicate Logic, Proof Methods, Set Theory | Rosen Chapter 1 and Chapter 2. | |
| 3 | Functions, Induction, Strong Induction | Rosen Chapter 2,5. | |
| 4 | Induction Cont., Algorithm Fundamentals,Counting | Rosen Chapter 4., Chapter 3, Chapter 6 | |
| 5 | Counting Cont., Pigeonhole Principle, Recurrence Relations | Rosen Chapter 6., Chapter 8.1,8.2,8.3 | |
| 6 | Recurrence Relations Cont, Generating Functions, Inclusion Exclusion | Rosen Chapter 8. | |
| 22-25 | Relations | Rosen Chapter 7. | |
| 26-31 | Graph Theory | Rosen Chapter 8. | |
| 32-36 | Group Theory | Liu Chapters 1-4 | |
| 37-40 | Number Theory |