CMPS 211

Discrete Structures

Computer Science ยท Faculty of Arts and Sciences ยท 3 credits
This course introduces students to discrete structures, focusing on those relevant to computing sciences. Topics covered include Logic and Proofs, Sets, Sequences, Functions, Growth of Functions, Algorithms and their complexities, Induction and Recursion, Counting, and Recurrence Relations.

What to expect

โœ“Has Quiz 1
โœ“Has Quiz 2
โœ“Has Final
โœ“Has Attendance
โœ“Has Graded Homeworks
โœ“Has Participation
โœ“Has Recitation
โœ“Original Book Necessary
  • Discrete Mathematics and its Applications, 7th Edition, by Kenneth H. Rosen, McGrawHill International