Rough Schedule (EXPECT IMPROMPTU CHANGES)

Week

 Lecture

Notes

1
lec 1 and 2  1.1
lec 3   1.2
Reading Assmt:  1.1 + 1.2
Event:

2
lec 4 and 5    1.2 + 1.3
lec 6     1.3
Reading Assmt 1.2+ 1.3
Event:

3
Lec 7 and 8 1.3+1.4 
Lec 9 1.4 + 2.1 
Reading Assmt: 1.3+1.4 + 2.1
Event :

4
Lec 10 and 11 Problems  
2 hours TEST  
Reading Assmt: 2.1 + 2.2
Event:

5
Lec 13/14 Problems + 2.1, 2.2,  
Lec 15 2.2 
Reading Assmt:2.3 and 3
Event:

6
Lec 16/17 2.3
Lec 18 4.1
Reading Assmt:
Event :

7
Lec 19/20 4.1 and 4.2  
Lec 21 4.2  
Reading Assmt: 4
Event:

8
Lec 22/23 Problems  
2 hours TEST  
Reading Assmt: 5
Event:

9
Lec 25/26 6  
Lec 27 6  
Reading Assmt: 6
Event:

10
SPRING BREAK  
SPRING BREAK  
Reading Assmt:
Event:

11
Lec 28/29 7  
Lec 30 7  
Reading Assmt: 7.1-7.3
Event:

12
Lec 31/32 7 +9 
Lec 33 7 +9 
Reading Assmt: 7.4, 7.5, 9
Event:

13
Lec 34/35 Problems  
2 hours TEST  
Reading Assmt: 8, 9, 10;
Event: 

14
Lec 37/38 10  
Lec 39 10  
Reading Assmt: 9 + 10
Event:

15
Lec 40/41 Further topics  
Lec 42 further topics  
Reading Assmt:
Event:

16
Lec 43/44 Problems 
Reading day Reading day 
Reading Assmt:
Event:

17
2hr FINAL 

Notes: All readings are from the Introduction to the Theory of Computation.