The course is organized as a progressive sequence of modules that build from foundational logical reasoning to the design and analysis of computational systems. Each module introduces new mathematical concepts while contributing to the semester-long Progressive Project.
Module 1 — Propositional Logic & Logical Reasoning (CLO1)
Introduction to symbolic logic, logical operators, truth tables, logical equivalence, and argument validity.
Module 2 — Predicate Logic & Proof Techniques (CLO1)
Predicate logic, quantifiers, direct proof, proof by contrapositive, contradiction, proof by cases, and formal mathematical reasoning.
Module 3 — Set Theory (CLO2)
Sets, subsets, set operations, Cartesian products, power sets, and set-based reasoning.
Module 4 — Functions & Relations (CLO2)
Functions, relations, properties, equivalence relations, partial orderings, and mathematical modeling.
Module 5 — Counting Theory & Combinatorics (CLO3)
Counting principles, permutations, combinations, the binomial theorem, and combinatorial reasoning.
Module 6 — Recursion & Recurrence Relations (CLO3)
Recursive definitions, recurrence relations, recursive problem-solving, and sequence analysis.
Module 7 — Graph Theory & Trees (CLO4)
Graphs, trees, paths, connectivity, traversals, and computational structures.
Module 8 — Boolean Algebra (CLO4)
Boolean operations, identities, simplification techniques, and logical system representation.
Module 9 — Combinational Logic & System Integration (CLO4, CLO5)
Logic gates, combinational circuits, Boolean implementation, system integration, and digital system design.
Module 10 — Final Project Integration & Presentation (CLO1–CLO5)
Integration, refinement, presentation, evaluation, and defense of the semester-long project demonstrating mastery of all course learning objectives.
Each module includes guided reading, formative assessments, applied assignments, discussion activities, and a Progressive Project milestone designed to support mastery of the course learning objectives.
Assessment in CSC 208 is designed to support progressive learning, authentic application, and continuous improvement. Students demonstrate understanding through formative assessments, applied assignments, project milestones, and capstone deliverables. The assessment structure emphasizes both mastery of discrete mathematics concepts and their application to computational problem-solving.