
| Instructor: | Ali Aydin Selcuk |
| Text Book: | Introduction to the Theory of Computation, Micheal Sipser. |
| Assistants: | Murat Ak (Mon 14.40) , Seher Acer (Tue 14.40) , Enver Kayaaslan (Wed 16.40) |
| Syllabus: | syllabus.pdf (contains detailed info) |
| Attendance: | 3% | |
| Quiz: | 20% | |
| Homework: | 20% | |
| Midterm: | 27% | |
| Final: | 30% |
| Quiz #: | Topic | Grader | Section-1 | Section-2 | Section-3 |
| Quiz 1: | DFA / NFA | Seher | 6.09 | 4.22 | 5.05 |
| Quiz 2: | FA Conversion / RL Closure | Enver | 2.76 | 6.15 | 4.91 |
| Quiz 3: | Regular Expression / DFA Equivalence | Murat | 4.57 | 3.77 | 6.30 |
| Quiz 4: | Context Free Languages | Seher | 5.33 | 5.38 | 5.15 |
| Quiz 5: | Context Free Grammar | Enver | 4.39 | 4.42 | 4.27 |
| Quiz 6: | PDA / CNF Conversion | Murat | 7.94 | 5.54 | 4.41 |
| Quiz 7: | Seher | 5.68 | 6.42 | 4.97 | |
| Quiz 8: | Turing Machine | Murat | 3.08 | 4.56 | 4.61 |
| Quiz 9: | Murat | ||||
| Quiz 10: | Enver | ||||
| Quiz 11: | Enver |