CSC 371Algorithms & Comp Theory

Augustana College · 4.0 credits · UGRD

Catalog

A rigorous study of the design, implementation, and analysis of algorithms, with a light introduction to theory of computation. Topics include worst-case vs. average-case performance, complexity classes, problem-solving strategies, heuristics, and NP-complete problems. Illustrative algorithm examples are chosen from classic data structures such as heaps, balanced trees, graphs, and hash tables. Additionally, theoretical models of computing such as finite state machines, regular languages, and Turing machines are introduced. Significant programming required. Prerequisite: C or better in CSC 202 & MATH 250

Recent sections

Fall 2026 · 2 sections

Aug 31 – Dec 11

Section	Days & time	Location	Instructor
01Class #91778	Mo We Fr · 10:00 – 11:15 AM	Olin Center 209Olin Center 204	Stonedahl, Forrest
01 notes: Instructional method: Lecture; Lecture
02