CS202: Discrete Structures

Explore fundamental concepts in discrete mathematics, including set theory, counting techniques, logic, mathematical induction, probability, recursion, graphs, trees, and finite-state automata in this comprehensive 44-hour course. Develop problem-solving skills and gain a solid foundation in discrete structures essential for computer science and related fields.

• Course Introduction
• Unit 1: Sets, Set Relations, and Set Functions
• Unit 2: Counting Theory
• Unit 3: Mathematical Logic
• Unit 4: Mathematical Induction and Proofs
• Unit 5: Probability
• Unit 6: Recursion
• Unit 7: Graphs
• Unit 8: Trees
• Unit 9: Finite-State Automata
• Study Guide
• Course Feedback Survey
• Certificate Final Exam