(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.
- 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.
Why Choose National University?
We’re proud to be a veteran-founded, San Diego-based nonprofit. Since 1971, our mission has been to provide accessible, achievable higher education to adult learners. Today, we educate students from across the U.S. and around the globe, with over 175,000 alumni worldwide.
Focus on one subject at a time — one month at a time — and finish your degree faster.
75+ Degree Programs
Choose from associate, bachelor’s, and master’s degrees, plus credentials and certificates.
On Campus or Online
Study when and where it’s convenient for you with evening, weekend, and 100% online classes.
Apply or transfer any time. Classes start monthly, and applications are accepted year round.
20+ Campus Locations
Attend class onsite at one of over 20 campus locations across California or in Nevada.
As a Yellow Ribbon school, we offer tuition discounts to servicemembers and dependents.
College of Letters and Sciences
“Our faculty are established scholars and creators in their own fields. They are dedicated to making your entry into their disciplines a successful one, preparing you for your career as well as graduate study.”College of Letters and Sciences