Lead Faculty: Dr. Igor Yakov Subbotin
Prerequisite
MTH 215 or MTH 216 A/B or placement evaluation
Course Description
(Cross listed and equivalent to CSC331)
Discrete mathematics forms the theoretical foundation for much of today's advanced technology in computer systems communications, digital signal processing, neural networks, control systems and information theory. This course studies combinatorics and graph theory. Also 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 and Bernoulli. Graphing calculator is required. Students may not receive credit for both MTH325 and CSC331.