Discrete Mathematics

Catalog description

This course was designed for students in math and computer science. Logic is emphasized in this course, and topics include proof and theory (including inductive and deductive proofs), propositional and predicate logic, set theory, algorithms (including recursion), trees, relations and functions, counting and probability, and elements of the theory of directed and undirected graphs (including Dijkstra's shortest path algorithm). Additionally, an introduction to complexity of algorithms and recurrence relations are included. Upon completion, students will be able to solve real world problems and use appropriate models for analysis. This course is only offered through the School of Extended Education.