CS 373
Fall 2012 Part of Term 1
Aug 27-Dec 12
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.
Prerequisite: CS 173 or MATH 213; CS 225.
Students must register for one lecture and one discussion section.
This course satisfies the General Education Criteria in
Fall 2022 for:
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
51760
|
Discussion/
Recitation |
AD1
|
2:00PM
-2:50PM
|
T
|
1214 Siebel Center for Comp Sci
|
Viswanathan, M
|
|
|
|
51761
|
Discussion/
Recitation |
AD2
|
3:00PM
-3:50PM
|
T
|
1214 Siebel Center for Comp Sci
|
Viswanathan, M
|
|
|
|
51762
|
Discussion/
Recitation |
AD3
|
1:00PM
-1:50PM
|
W
|
1214 Siebel Center for Comp Sci
|
Viswanathan, M
|
|
|
|
51763
|
Discussion/
Recitation |
AD4
|
4:00PM
-4:50PM
|
W
|
1214 Siebel Center for Comp Sci
|
Viswanathan, M
|
|
|
|
55969
|
Discussion/
Recitation |
AD5
|
5:00PM
-5:50PM
|
W
|
1214 Siebel Center for Comp Sci
|
Viswanathan, M
|
|
|
|
51739
|
Lecture
|
AL1
|
11:00AM
-12:15PM
|
TR
|
1320 Digital Computer Laboratory
|
Viswanathan, M
|
|