Skip to main content
CS218

Data Structure and Algorithms

Course DirectorySNHU CS218 has 4 direct prerequisites, with 9 courses in its complete prerequisite tree, and is required by 8 other courses.

Undergraduate · 3 credits

This course explores fundamental data structures and algorithms such as stack, queue, tree, graph, and hash table. It discusses various implementations of these data structures and algorithms. The course also examines commonly used fast sorting algorithms with in-depth analysis of time and memory use. Students will not only understand the concepts but will also implement solutions using appropriate data structures and algorithms.

Prerequisite Tree

  • CS210 — Programming Languages
    • IT145 — Foundation in Application Development
      • CS110 — Fundamentals of Programming
      • IT140 — Introduction to Scripting
  • CS217 — Object Oriented Programming
    • CS113 — Introduction to Programming
    • CS113L — Introduction to Programming Lab
    • IT145 — Foundation in Application Development
      • CS110 — Fundamentals of Programming
      • IT140 — Introduction to Scripting
  • MAT230 — Discrete Mathematics
  • MAT239 — Mathematics for Computing

Interactive Prerequisite Graph

This Course Is Also a Prerequisite For

Unofficial — For Informational Purposes Only

This site is unofficial and is intended for informational purposes only. Course requirements, transfer evaluations, catalog rules, and program requirements can change. Always confirm your academic plan with your SNHU advisor for official guidance.