CP214
Discrete Structures for Computer Science
0.5 Credit

Hours per week:
  • Lecture/Discussion: 3

Finite and discrete algebraic structures relating to computers: sets, functions, relations. Machine-oriented logic. Topics include: propositional and predicate calculus, Boolean algebra, combinatorial counting (including Pigeonhole principle, permutations and combinations), recurrence equations, applications of recurrence equations in sorting algorithms, relations (including equivalence relations, partial orders), algorithms to generate permutations and combinations, induction and recursive programs, correctness proofs for both recursive and iterative program constructions, countable and uncountable sets, Cantorís theorem, introduction to graph theory and graph algorithms.

Additional Course Information
Prerequisites
CP164