CS312Analysis of Algorithms

Course Prerequisites ToolSNHU CS312 has 1 direct prerequisite, with 10 courses in its complete prerequisite tree.

Undergraduate · 3 credits

Basic algorithmic analysis and strategies are explored along with fundamental computing algorithms. Connections between regular languages and finite automata, context-free languages and pushdown automata, and Turing machines and computation are established. The complexity classes P and NP will also be introduced.

Prerequisite Tree

CS218 — Data Structure and Algorithms
- 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

Interactive Prerequisite Graph

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

CS312

Analysis of Algorithms

CS218

Data Structure and Algorithms

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

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.