Quizzes: 20% Two Midterm Examinations: 45% Final Comprehensive Examination: 35%
number of points earned / total number of points x 100For example, if you earn 65 points out of a total of 80 points that it is possible for you to earn on quizzes your quiz average would be:
65 / 80 x 100 = 81.25Final course grades are determined using a curve based on the course-grade averages. No special arrangements will be made for extra credit for improving grades.
You can verify all of your grades and check your projected
final course grade on line starting after the first midterm examination.
http://www.cs.potsdam.edu/Classes/301/announce.html
| Date |
Topic/Reading |
Notes |
Homework |
|---|---|---|---|
| Aug 31 | Class Administration, Introduction and Review (Ch 0) | 0 Slides / 0 Handouts | End of Chapter 0 (1-12) |
| Sep 7 | Finite Automata (Ch 1.1) | 1.1 Slides / 1.1 Handouts | End of Chapter 1 (1-6, 14) |
| Sep 15 | Nondeterministic Finite Automata (Ch 1.2) | 1.2 Slides / 1.2 Handouts | End of Chapter 1 (7, 8, 9, 10, 11, 14, 15, 16, 31, 36) |
| Sep 28 | Nondeterministic Finite Automata (Ch 1.3) | 1.3 Slides / 1.3 Handouts | End of Chapter 1 (18, 19, 20, 21, 39, 48) |
| Oct 12 | Nonregular Languages (Ch 1.4) | 1.4 Slides / 1.4 Handouts | End of Chapter 1 (29, 30, 55 (feel free to argue with me about 55)) |
| Oct 26 | Context-Free Languages (Ch 2.1) | 2.1 Slides / 2.1 Handouts | End of Chapter 2 (1, 3, 4, 8, 9, 19) |
| Nov 2 | (Ch 2.2 and 2.3 Pushdown Automata and Non-Context-Free Languages) | 2.2/3 Slides / 2.2/3 Handouts | End of Chapter 2 (5, 9, 11, 12, 13, 18, 22) |
| Nov 11 | (Ch 3.1 Turing Machines) | 3.1 Slides / 3.1 Handouts | End of Chapter 3 (1,2,5,8) |
| Nov 20 | (Ch 3.2 Variations on Turing Machines) | 3.2 Slides / 3.2 Handouts | End of Chapter 3 (3,6,7,11,12,15,16) |