Welcome.
This course will cover fundamental mathematical concepts related to computer science, including: Finite and infinite sets, relations, functions, and propositional logic. Introduction to other techniques, modeling and solving problems in computer science. Introduction to permutations, combinations, graphs, and trees with selected applications.
Instructor: Yiannis Aloimonos, 4475 A.V.Williams, yiannis@cs.umd.edu Office hours: Mon 1112 Tue: 12:301:30 wed: 12 Textbook: Discrete Mathematics with Applications, by Susanna S. Epp TA Office hours in AVW 1112
Course weights: Coursework will count toward the final grade according to the following percentages
Exams: Exams will be held during lecture. Anticipated exam dates

Lecture Notes
Supplementary Materials Homeworks
