CS 273
Spring 2006 Part of Term 1
Part of Term 1
Jan 17-May 3
Jan 17-May 3
Credit: 3 hours.
Finite automata and regular languages; pushdown automata and context-free languages; Turing machines and recursively enumerable sets; computability and the halting problem; undecidable problems; computational complexity and NP-completeness.
Prerequisite: CS 125 and either CS 173 or MATH 213.
This course satisfies the General Education Criteria in
Fall 2022 for:
Quantitative Reasoning II
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
31259
|
Lecture-Discussion
|
P
|
11:00AM
-12:15PM
|
TR
|
Digital Computer Laboratory
|
Pitt, L
Fleck, M |
|