Course: Discrete Mathematics
|Hours Per Week:||4|
Logic and Proofs. Finite and Infinite Sets. Computability. Formal Languages and Grammars. Permutations, Combinations and Discrete Probability. Relations and Functions. Graphs and Trees. Finite State Machines. Discrete Numeric Functions and Generating Functions. Algorithms and Complexity. Recursive Relations.
Upon successful completion of this course, students will:
Written intermediate exams (20%), Written final exams (80%)