Course: AMT 223 1.0 Discrete Mathematics (Compulsory)
Course content:
Tools of Discrete Mathematics: Algorithms, Induction and Recursion; Elementary Counting Techniques: Fundamental principles of counting, Permutations and combinations, Combinatorial problems involving repetitions, The pigeonhole principle; Additional Topics in Combinatorics: Combinatorial identities, Modeling combinatorial problems with recurrence relations, Solving recurrence relations, The inclusion-exclusion principle, Generating functions.
Recommended Readings:
- Baker,T.P.,Kandel,A., & Mott,J.L.(1986). Discrete Mathematics for Computer Scientists and Mathematicians (2nd ed). Pearson Education
- Grossman,J.W. (1990). Discrete Mathematics (An Introduction to Concepts, Methods, and Applications) (1st ed). Macmillan Publishing Company.