Today an increasing proportion of the application of mathematics involves discrete rather than continuous models. The main reason for this trend is the integration of the computer into more and more of modern society. This course is an introductory course in discrete mathematics. It provides the mathematical background that is needed in computer science. Topics include proofs, sets, sequences, relations and functions, design and analysis of algorithms, solving recurrence relations, counting methods and the pigeonhole principle, graph theory, trees, Boolean algebra and combinatorial circuits, automata, grammars and languages.

Course announcements, power point lectures, homework, demos...etc. are on Blackboard