Skip to main content
SNHUCourse Prerequisites
Tools

CS218Data Structure and Algorithms

Course Prerequisites ToolSNHU 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

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

This Course Is Also a Prerequisite For

Interactive Prerequisite Graph

Explore the prerequisite relationships visually. The graph below supplements the crawlable list above.

React Flow

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.