This course is an introduction to discrete mathematics with an emphasis on understanding and analyzing mathematical proofs and computer applications. The topics covers include functions, asymptotic complexity, elementary logic and set theory, graphs, finite state automata, equivalent relations, counting arguments, recursion, combinatorial circuits, trees, and Boolean algebra, combinatorics, diagonalization, etc. It also includes practice in reasoning formally and proving theorems.
At the end of the course, students will be able to:
• Understand and perform different proof techniques, induction, contradiction, etc.
• Understand the basic set theory and Boolean logic.
• Write understandable mathematical statements using standard mathematical terminology and notations.
• Identify with the basic theorems and their implications in different discrete fields
Prerequisite: An understanding of Calculus is required