MATH 226 — : Discrete Mathematics
Designed for students majoring in mathematics or computer science, this course introduces discrete mathematics, including logic, methods of proof, number theory, sets, counting, discrete probability, relations, recursion, recurrence relations, Boolean algebra, graphs, trees, and networks. Topics are illustrated with applications to computer science, including design and analysis of algorithms, undecidability, program correctness, and digital logic design.