CSC 205 — Discrete Mathematics
The course introduces fundamental ideas in discrete structures, serving as abasis for subsequent courses required for students in Computer Science: Sets,relations, and functions; propositional calculus, Boolean algebra, andcombinatorial circuits, counting methods; proof techniques; analysis ofalgorithms; graphs and trees, puzzles; finite machines, sequential circuits, and recognizers and coding theory.