Physics & Computer Science

CP214: Discrete Structures for Computer Science

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.

3 lecture/discussion hours

Credit: 0.50

Prerequisite: CP164

Section Information
Section Days Times Room Instructor
Lecture A TR - Ms Pooja Vashisth