TENTATIVE Rough Schedule (EXPECT IMPROMPTU CHANGES)

Week

 Lecture

Notes

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

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

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

4
Lec 10 Problems  
Lec 11+ 12  
Reading Assmt: 2.1 + 2.2
Event:

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

6
Lec 16 2.3
TEST TEST
Reading Assmt:
Event :

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

8
Lec 22 Problems  
Lec 23/24  
Reading Assmt: 5
Event:

9
Lec 25 6  
2hours Test  
Reading Assmt: 6
Event:

10
Lec 28  
Lec 29/30  
Reading Assmt:
Event:

11
Lec 31 7  
Lec 32/33  
Reading Assmt: 7.1-7.3
Event:

12
Lec 34 7 +9 
Lec 35/36 7 +9 
Reading Assmt: 7.4, 7.5, 9
Event:

13
Lec 37 Problems  
2 hours TEST  
Reading Assmt: 8, 9, 10;
Event: 

14
Lec 40 10  
THANKSGIVING  
Reading Assmt: 9 + 10
Event:

15
Lec 43 Further topics  
Lec 44/45 Further topics 
Reading Assmt:
Event:

16
Lec 46 Problems 
Reading day Reading day 
Reading Assmt:
Event:

17
2hr FINAL 

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