An introduction to discrete Mathematics, with emphasis on topics that are closely related to computer science. Core topics include Counting, Logic and Quantifiers, Set Theory, Formal Reasoning and Induction, Functions and Relations, Number Theory. Additional topics to be covered may be selected from Trees, Growth of Functions, Automata Theory and Formal Languages.

Lecture Hours: 45