CS 212 Discrete Structures
A broad survey of the mathematical tools necessary for an understanding of computer science. Topics covered include an introduction to sets, relations, functions, basic counting techniques, permutations, combinations, graphs, recurrence relations, simple analysis of algorithms, O-notation, Boolean algebra, propositional calculus, and numeric representation.