CS 273
Fall 2005 All Classes
All Classes
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 | |
|---|---|---|---|---|---|---|---|---|
|
30107
|
Lecture-Discussion
|
P
|
12:30PM
-1:45PM
|
TR
|
100 Materials Science & Eng Bld
|
Wong, L
Lavalle, S Mienk, P Young, P |
|