Syllabus, CPS 140, Spring 2002

Tuesday Thursday
1/8
NO CLASS
1/10
Introduction (notes)
Reading: Chap 1
Homework 1
1/15
Finite Automata (notes)
Reading: Chap 2.1-2.2
Recitations begin
1/17
Reading: Chap 2.3-2.4
Homework 1 due
Homework 2
1/22
Regular Languages (notes)
Reading: Chap 3
No recitations this week
1/24
Regular Properties (notes)
Reading: Chap 4.1-4.2
Homework 2 due
Homework 3
 Project 1
1/29
Reading: Chap 4.3
Note typo on hw3
1/31
Context-free Languages (notes)
Reading: Chap 5.1-5.2
Hw 3 Due
Going over hw
Grades
Homework 4
2/5
Reading: Chap. 5.3
Note on Project 1
 2/7
Pushdown Automata (notes)
Reading: Chap 7.1-7.2 Project 1 Due, 11pm
Hw 4 due
2/12
Reading: Chap 7.3-7.4
Kashi: Wed 2:30-3:30
 2/14
Test 1
2/19
Parsing (notes) 		2/21
LL Parsing (notes)
Homework 5 out
Rodger hours next week - Tue, wed morn.
2/26
LR Parsing (notes)
 2/28
Reading: Chap 6
Homework 5 due
Transforming Grammars (notes)
3/5
Reading: Chap 8
Homework 6 out
 Project 2 out
 3/7
CFL Properties (notes)
3/12
SPRING BREAK
3/14
SPRING BREAK
3/19
Reading: Chap 9
Turing Machines (notes)
Homework 6 due
Homework 7 out
 3/21
TM for ww
3/26
Combine TM (notes)
 3/28
Project 2 due
test 2 review
Review
4/2
Test 2
 4/4
L-Systems (notes)
L-systems paper
 Project 3 out
Homework 8 out
4/9
Reading: Chap. 10
Models of TM (notes)
Project 3 PART A due
4/11
Reading: Chap. 11
Homework 8 due
4/16
Recursively Enumerable (notes)
 4/18

Project 3 PART B due
4/23
final review
Winners
Compilers (notes)
Review
 4/25

STUDY DAY
4/30
Final Exam, 2pm

Susan Rodger
Last modified: Tue Apr 23 14:05:26 EDT 2002