Discrete Mathematics

A study of the basic techniques and modes of reasoning of combinatorial problem solving. Sets, functions, and algorithms; counting methods and recurrence relations; graph theory; trees; network models; Boolean algebra and combinatorial circuits.