CSC 371
Algorithms & Comp Theory
Augustana College · UGRD · Fall 2026
Catalog description
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
Sections
Current meeting, instructor, credit, and enrollment details
01
FullSeats: 24/24 seats Last recorded: Aug 15, 2026, 5:35 PM- Days & times
- M/W/F 10:00 AM-11:15 AM; M/W/F 10:00 AM-11:15 AM
- Meeting dates
- Aug 31 – Dec 11
- Location
- Olin Center 209; Olin Center 204
- Instructor
- Stonedahl, Forrest
Section notes
Instructional method: Lecture; Lecture
02
9 openSeats: 15/24 seats Last recorded: Aug 15, 2026, 5:35 PM- Days & times
- M/W/F 11:30 AM-12:45 PM; M/W/F 11:30 AM-12:45 PM
- Meeting dates
- Aug 31 – Dec 11
- Location
- Olin Center 209; Olin Center 204
- Instructor
- Stonedahl, Forrest
Section notes
Instructional method: Lecture; Lecture