MTH325 Discrete Mathematics

Lead Faculty: Dr. Igor Ya Subbotin

Course Description

(Cross listed and equivalent to CSC331) This course studies combinatory and graph theory as the theoretical foundation for today's advanced technology. It analyzes algorithms, logic, circuits, number bases, and proofs. Ample applications (graphs, counting problems, Turing Machines, codes) examine the ideas of Euler, Boole, Floyd, Warshall, Dijkstra, Church and Turing, Shannon, Bernoulli. Graphing calculator is required. Students may not receive credit for both MTH325 and CSC331.

Learning Outcomes

  • Discuss the nature of proof and the essentials of propositional and predicate calculus.
  • Understand recursion and induction.
  • Understand the analysis and verification of algorithms and the algorithmic method.