(Cross-listed and equivalent to MTH 325) A theoretical foundation for computer science. Introduction to topics such as sets, propositional logic, Boolean algebra, counting techniques, recursive equations and solution techniques, graph algorithms with application to trees. Introduction to mathematical proofs. Students may not receive credit for both CSC 331 and MTH 325.
- Understand and apply the ideas and symbols of mathematical logic.
- Infer truth values for compound statements using truth tables.
- Prove mathematical results by induction.
- Formulate recursive definitions, and analyze them.
- Analyze algorithms for correctness and performance.
- Calculate the cardinality of possible outcomes using the fundamental principles of counting, permutations, combinations, and partitions.
- Use graph theory to model real world problems.
- Describe common graph algorithms and analyze their time complexity.
Why Choose National University?
Focus on one subject at a time — one month at a time — and finish your degree faster.
100+ 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.
School of Engineering and Computing
“The School of Engineering and Computing fosters student creativity, innovation, and entrepreneurship in classes taught by subject matter experts who actively practice what they teach.”School of Engineering and Computing