CS 350

Analysis of Algorithms

Milligan University · UGRD · Fall 2026

1 section

Catalog description

A study of theoretical models of computation, including finite state machines, pushdown automata, context- free grammars, Turing machines, decidability, complexity theory, and NP- Completeness. This study covers efficient computation, models of computational processes, and their limits. Prerequisites: CS 211 and CS 307. Offered spring term odd years. Three semester hours.

Sections

Current meeting, instructor, credit, and enrollment details

Updated 5 hours ago

001

Availability not recently verified

Class #milligan-0194Fall 2026UGRD3 credits

Days & times: No scheduled meeting time
Meeting dates: —
Location: —
Instructor: Staff

Class numbers and section codes come from the registrar.

Spot missing or incorrect course data?