Computer Science at Denison University

Intro sequences

The shortest canonical route from each entry point to a gateway course.

• 1. CS 105Introduction to Computer Science (4 Credit Hours)
  2. CS 145Introduction to Algorithm Design (4 Credit Hours)
• 1. CS 109Discovering Computer Science (4 Credit Hours)
  2. CS 173Intermediate Computer Science (4 Credit Hours)
• 1. CS 111Discovering Computer Science: Scientific Data and Dynamics (4 Credit Hours)
  2. CS 173Intermediate Computer Science (4 Credit Hours)
• 1. CS 112Discovering Computer Science: Markets, Polls, and Social Networks (4 Credit Hours)
  2. CS 173Intermediate Computer Science (4 Credit Hours)

Gateway courses

Each of these unlocks the largest share of downstream work on this map. Courses from other departments can appear here when they genuinely gate CS coursework.

• MATH 135Single Variable Calculus (4 Credit Hours)opens 28 courses (3.3 directly)
• MATH 145Multivariable Calculus (4 Credit Hours)opens 27 courses (7.3 directly)
• CS 145Introduction to Algorithm Design (4 Credit Hours)opens 27 courses (5.4 directly)
• CS 173Intermediate Computer Science (4 Credit Hours)opens 22 courses (4 directly)
• CS 234Mathematical Foundations of Computer Science (4 Credit Hours)opens 19 courses (2.5 directly)
• MATH 300Introduction to Proofs (4 Credit Hours)opens 19 courses (2.5 directly)

The map

Intro tiers at the top, advanced work below; arrows point from a prerequisite to the course it unlocks. Courses from other departments appear where they gate CS work. Click any course to see what it requires and unlocks without leaving this page; hovering lights up its neighbors. The lists on this page carry the same courses in text form.

Showing the 46 CS and feeder courses that have prerequisite links. 12 more CS courses have no recorded prerequisites. They are listed under Tracks below, not drawn as loose dots here.

Concentration routes

The concentrations and majors that build on CS, and how their requirements are structured. Expand a program to see which courses satisfy each group, then plan it in the Planner.

Tracks

Upper-level clusters, grouped by the gateway that opens them.

The longest ladders

The deepest prerequisite chains in CS. These are the routes that take the most semesters to climb.

• 7 courses deep, ending at CS 374

  1. MATH 130Essentials of Calculus (4 Credit Hours)
  2. MATH 135Single Variable Calculus (4 Credit Hours)
  3. MATH 145Multivariable Calculus (4 Credit Hours)
  4. CS 234Mathematical Foundations of Computer Science (4 Credit Hours)
  5. CS 271Data Structures (4 Credit Hours)
  6. CS 334Theory of Computation (4 Credit Hours)
  7. CS 374Compilers (4 Credit Hours)

• 7 courses deep, ending at CS 495

  1. MATH 130Essentials of Calculus (4 Credit Hours)
  2. MATH 135Single Variable Calculus (4 Credit Hours)
  3. MATH 145Multivariable Calculus (4 Credit Hours)

• 5 courses deep, ending at CS 337

  1. MATH 130Essentials of Calculus (4 Credit Hours)
  2. MATH 135Single Variable Calculus (4 Credit Hours)
  3. MATH 145Multivariable Calculus (4 Credit Hours)

• 4 courses deep, ending at CS 287

  1. CS 105Introduction to Computer Science (4 Credit Hours)
  2. CS 145Introduction to Algorithm Design (4 Credit Hours)
  3. CS 231Foundations of Concrete Structures (4 Credit Hours)

Grade medians

Professors

No section schedule with instructor names for CS yet.

Clubs & organizations

No clubs or organizations on record under CS yet.

Clubs students here join

Department events

Computer Science does not run a page here yet. When it does, its events show up here and on the Denison campus feed.