
Maths 230 · 4 credits · NCCRS
Discrete Mathematics
Logic and proof, sets and functions, counting and probability, recurrences, graphs, trees and Boolean algebra.
Home › Courses › Discrete Math vs Data Structures and Algorithms
Discrete Mathematics is the math (logic and proof, counting, recurrences, graphs and trees); Data Structures and Algorithms is the programming (arrays, lists, trees, hash tables, sorting and graphs, built in Java). Neither syllabus lists a prerequisite, and if you need both, Discrete Mathematics first lets you meet graphs, trees and recursion as math before you code them.

Maths 230 · 4 credits · NCCRS
Logic and proof, sets and functions, counting and probability, recurrences, graphs, trees and Boolean algebra.

Computer Science 251 · 3 credits · NCCRS
Data structures and algorithms in Java: arrays, linked lists, stacks, queues, trees, hash tables, sorting and graphs.
From the syllabi: what only one course covers, and where they meet.
| Discrete Mathematics | Data Structures and Algorithms | |
|---|---|---|
| Course code | Math 230 | Computer Science 251 |
| Credit (NCCRS) | 4 semester hours | 3 semester hours |
| Chapters | 13 chapters | 17 chapters |
| Instructional hours | 46 hours | 56 hours |
| Graphs and trees | As math: paths, circuits, spanning trees | As code: tree structures, search trees, shortest paths |
| Programming | No programming chapters | Java, from your first program |
| Prerequisites | None listed | |
| Final exam | 100 multiple-choice questions | |
Both are self-paced: quizzes and the assignment are open-book, the final is proctored, and 70 or higher passes.
Neither has a prerequisite.


You can take them in either order: neither syllabus lists a prerequisite. If you need both, Discrete Mathematics first lets you meet graphs, trees and recursion as math before you build them in Java in Data Structures and Algorithms.
Its syllabus lists no prerequisite and starts with your first Java program, then object-oriented design, before the data structures. If you want more Java first, see Introduction to Java.
Graphs, trees and recursion are in both syllabi. Discrete Mathematics treats them as math: Euler and Hamiltonian paths, spanning trees, recursive functions and recurrence relations. Data Structures and Algorithms builds them in Java: tree structures, search trees, recursive methods and graph algorithms such as Dijkstra's.
Discrete Mathematics: NCCRS recommends 4 semester hours, lower or upper division, in Calculus among other subjects. Data Structures and Algorithms: NCCRS recommends 3 semester hours, lower division, in Computer Science among other subjects.
Discrete Mathematics: Calculus or Mathematics. Data Structures and Algorithms: Computer Science. Your college decides which requirement each one fills.
Data Structures and Algorithms is longer by its syllabus. Discrete Mathematics: 13 chapters and 46 instructional hours. Data Structures and Algorithms: 17 chapters and 56 instructional hours. Both are self-paced, so you finish as fast or as slow as you want.
Discrete Mathematics: 100 multiple-choice questions, 25% of the grade. Data Structures and Algorithms: 100 multiple-choice questions.
The syllabus lists Rachel Zax and Harry Lewis. Essential Discrete Mathematics for Computer Science, Princeton University Press, 2019 (optional), with other references.
No: neither is on the ACE list. Discrete Mathematics has an NCCRS recommendation for 4 semester hours in Calculus; Data Structures and Algorithms has an NCCRS recommendation for 3 semester hours in Computer Science. Not being on the ACE list never means not recommended for credit.
Software Engineering. In the “Software and AI” order on the Computer Science courses page, it follows Data Structures and Algorithms. Your program may set its own order.
Once Discrete Mathematics shows 100% complete in your dashboard. Assignments take about 48 hours to be checked, so allow about two days after your last submission; then request the transcript and UPI Study emails it to your college.
70 or more passes Discrete Mathematics. Your transcript's grading scale shows the letter grade 70 maps to, which most colleges read as a C.
ACE and NCCRS have over 2,100 cooperating colleges that will consider accepting credits; the final decision is with the universities. Search your school in Find My College and ask your registrar which courses Math 230 and Computer Science 251 would count as. It helps to name the subject: NCCRS recommends Discrete Mathematics in Calculus and Data Structures and Algorithms in Computer Science.
ACE and NCCRS have over 2,100 cooperating colleges that will consider accepting credits; the final decision is with the universities.



















Plus many more partner colleges and ACE and NCCRS cooperating colleges.
Find My College →




ACE and NCCRS have over 2,100 cooperating colleges that will consider accepting credits; the final decision is with the universities.
UPI Study facts are from our course catalog, syllabi and course rules.