MATH 2011 — Discrete Structures of Computer Science

Concepts fundamental to the analysis of algorithms. Topics include logic, sets, methods of proof including mathematical induction, combinatorics, relations, solution of recurrence relations, graphs and trees.

Prerequisites: MATH 1510