### CS 525, Theory of Computation, Evening
Section, Winter 2014

Instructor

Krzysztof Nowak

e-mail:
kn33@drexel.edu

Office Hours: Monday, Wednesday, Friday 1:00 pm - 1:50 pm, University Crossings
109

Teaching Assistant

Mark Boady

e-mail:
mwb33@drexel.edu

Office Hours:
Wednesday 4 pm - 6 pm, University Crossings 147

Mark’s website: https://www.cs.drexel.edu/~mwb33/cs525_w2014/index.html

### Course Materials

#### Final Exam, Quizzes 7-9, Homework Assignments
6-7

Quiz 7, 03/05/14, covers 7.1-7.2

Practice problems

3^{rd} edition: 7.1-7.4, 7.6, 7.8-7.10, 7.13, 7.15

2^{nd} edition: 7.1-7.4, 7.6, 7.8-7.10, 7.12, 7.14

Homework 6 due in class on 03/12/14

Textbook problems

3^{rd} edition: 7.8-7.10, 7.13

2^{nd} edition: 7.8-7.10, 7.12

Quiz 8, 03/12/14, covers 7.3-7.4, Solutions of Quiz 8 problems

Practice problems

3^{rd} edition: 7.5, 7.7, 7.12, 7.16-7.17, 7.19-7.23

2^{nd} edition: 7.5, 7.7, 7.11, 7.15-7.16, 7.18-7.22

Homework 7 due in class on 03/19/14 (you
are allowed to use the results of 7.5 as the ingredients of your solutions)

Textbook problems

3^{rd} edition: 7.5, 7.7, 7.12, 7.20

2^{nd} edition: 7.5, 7.7, 7.11, 7.19

Final Exam, 03/19/14, 6 pm - 9 pm, UC 153,
covers 1.1-1.4, 2.1-2.4, 3.1-3.3, 4.1-4.2, 5.1-5.3, 6.1-6.3, 7.1-7.4

Problem part of the
final exam (6 pm – 8 pm) will consist of eight problems, three of these
problems will be related to the material covered during weeks 1-4, two will
correspond to the coverage of weeks 5-7, and three of them to weeks 8-10. You
will need to select six problems for your submission. Proof part (8 pm – 9 pm)
will consist of five theorems. You will need to formulate all five theorems in
detail and choose three out of them for the presentation with the proofs.

Final exam practice problems

All practice problems for
quizzes and tests, and all test and homework problems.

Theorems for Final Exam (you need to be familiar with all
theorems listed below and with their proofs):

Theorems for Tests 1-2 and

1. Complexity relationships among models, Theorems 7.8, 7.11

2. Examples of problems in class P, Theorems 7.14, 7.15, 7.16

3. NP description in terms of NTMs, Theorem 7.20

4. Examples of NP problems, Theorems 7.24, 7.25

5. Polynomial time reducibility, Theorems 7.31, 7.35, 7.36

6. 3SAT is polynomial time reducible to CLIQUE, Theorem 7.32

7. The Cook-Levin theorem, Theorem 7.37