Discrete Math vs Data Structures and Algorithms: Which First?

Home › Courses › Discrete Math vs Data Structures and Algorithms

Math 230 vs CS 2514 vs 3 creditsNCCRS recommended

Discrete Math vs Data Structures and Algorithms: which first?

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.

Take first
Either; Discrete Math helps
Shared ideas
Graphs, trees, recursion
Credit
4 vs 3 semester hours

What you learn

From the syllabi: what only one course covers, and where they meet.

Only in Discrete Mathematics

  • Logic and proof
  • Sets and functions
  • Counting and probability
  • Recurrence relations
  • Matrices
  • Boolean algebra

In both

  • Graphs
  • Trees and tree traversal
  • Recursion

Only in Data Structures and Algorithms

  • Java and object-oriented design
  • Arrays and linked lists
  • Stacks and queues
  • Hash tables
  • Heaps and priority queues
  • Big-O analysis

Side by side

Discrete Mathematics (Math 230) and Data Structures and Algorithms (CS 251), from the two syllabi
 Discrete MathematicsData Structures and Algorithms
Course codeMath 230Computer Science 251
Credit (NCCRS)4 semester hours3 semester hours
Chapters13 chapters17 chapters
Instructional hours46 hours56 hours
Graphs and treesAs math: paths, circuits, spanning treesAs code: tree structures, search trees, shortest paths
ProgrammingNo programming chaptersJava, from your first program
PrerequisitesNone listed
Final exam100 multiple-choice questions

Both are self-paced: quizzes and the assignment are open-book, the final is proctored, and 70 or higher passes.

Which one should you take first?

Neither has a prerequisite.

Take Discrete Math first if

  • Your degree needs both courses
  • You want graphs, trees and recursion as math first
  • Your program lists Discrete Mathematics

Take Data Structures and Algorithms if

  • Your program lists Data Structures
  • You want to write code in Java
  • You need hash tables, heaps, sorting and graphs

Questions, answered

Should I take Discrete Math before Data Structures?

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.

Do I need to know Java for 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.

What discrete math does Data Structures and Algorithms use?

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.

How many credits are Discrete Mathematics and Data Structures and Algorithms?

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.

What subject areas do Discrete Mathematics and Data Structures and Algorithms count in?

Discrete Mathematics: Calculus or Mathematics. Data Structures and Algorithms: Computer Science. Your college decides which requirement each one fills.

Which is longer, Discrete Mathematics or Data Structures and Algorithms?

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.

What are the final exams like in Discrete Mathematics and Data Structures and Algorithms?

Discrete Mathematics: 100 multiple-choice questions, 25% of the grade. Data Structures and Algorithms: 100 multiple-choice questions.

Which textbook does Discrete Mathematics use?

The syllabus lists Rachel Zax and Harry Lewis. Essential Discrete Mathematics for Computer Science, Princeton University Press, 2019 (optional), with other references.

Are Discrete Mathematics and Data Structures and Algorithms on the ACE list?

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.

What should I take after Data Structures and Algorithms?

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.

When can I request my Discrete Mathematics transcript?

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.

What grade do I need to pass Discrete Mathematics?

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.

Do colleges give credit for Discrete Mathematics and Data Structures and Algorithms?

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.

Where these credits can go

ACE and NCCRS have over 2,100 cooperating colleges that will consider accepting credits; the final decision is with the universities.

  • Thomas Edison State University (TESU) logo
  • University of the People logo
  • Strayer University logo
  • Post University logo
  • Charter Oak State College logo
  • Indiana Tech logo
  • Columbia Southern University logo
  • University of Arkansas Grantham logo
  • American College of Education logo
  • Nexford University logo
  • Newlane University logo
  • Pathways College logo
  • Dunlap-Stone University logo
  • Woodmont College logo
  • University of Management and Technology (UMT) logo
  • Crestpoint University logo
  • Maestro University (formerly Bottega University) logo
  • Gracelyn University logo
  • EC-Council University logo

Plus many more partner colleges and ACE and NCCRS cooperating colleges.

Find My College →

Keep exploring

Check your college first

ACE and NCCRS have over 2,100 cooperating colleges that will consider accepting credits; the final decision is with the universities.

Sources (3)

UPI Study facts are from our course catalog, syllabi and course rules.