MTH 325 - Discrete Mathematics

Institution:

National University

Subject:

Description:

(Cross listed and equivalent to CSC331) (Prerequisites: MTH 215 or MTH 216A/B or placement evaluation) 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. Students may not receive credit for both MTH325 and CSC331.

Credits:

4.50

Credit Hours:

Prerequisites:

Corequisites:

Exclusions:

Level:

Instructional Type:

Lecture

Notes:

Additional Information:

Historical Version(s):

Institution Website:

www.nu.edu

Phone Number:

(800) 628-8648

Regional Accreditation:

Western Association of Schools and Colleges

Calendar System:

Other academic year

The Course Profile information is provided and updated by third parties including the respective institutions. While the institutions are able to update their information at any time, the information is not independently validated, and no party associated with this website can accept responsibility for its accuracy.