CS 525, Theory of Computation, Online Section,
Winter 2014
Instructor
Krzysztof Nowak
e-mail:
kn33@drexel.edu
Teaching Assistant
Mark Boady
e-mail:
mwb33@drexel.edu
Mark’s website (with online submission details and online office hours details):
https://www.cs.drexel.edu/~mwb33/cs525_w2014/index.html
Online Office
Hours: Tuesday 4-6
pm (EST time)
Course Materials
Syllabus, Reading
Assignments, Lectures: #1,#2,#3,#4,#5,#6,#7,#8,#9,#10
Live
Broadcasts and Recordings of Lectures
Past Items
Test
1, Quizzes 1-3, Homework Assignments 1-3
Test 2, Quizzes4-6, Homework
Assignments 4-5
Announcements
All tests and quizzes
will be open book. You will be allowed to use the textbook, but not notes, no
other materials and no calculators.
All submission times indicated in the announcements section refer to the local
time zone of your residence.
Quiz rules: Quiz problems will be posted on the CS 525 course
website at times and dates indicated in the announcements section (EST time). Once
you download quiz problems you will have 60 minutes for working out your
solutions, and 15 more minutes for packaging them into pdf format and
submitting them (to Bb Learn; how you submit your answers is described on
Mark’s website).
Test rules: Test problems will be made available (at Bb Learn;
how you get them and how you submit your answers to Bb Learn is described on
Mark’s website) at times and dates indicated in the announcements section (EST
time). You will have 60 minutes for working out test problems (tests 1-2), 30
minutes for answering questions about proofs, and still 15 more minutes for
packaging your answers into pdf format and submitting them. Times of the pickup
of your test and the submission of your answers will be recorded.
Final exam rules: Final exam document will be made
available (at Bb Learn; how you get it and how you submit your answers to Bb
Learn is described on Mark’s website) at times and dates indicated in the
announcements section (EST time). You will have 120 minutes for working out
final exam problems, 60 minutes for answering questions about proofs, and still
15 more minutes for packaging your answers into pdf format and submitting them.
Times of the pickup of your test and the submission of your answers will be
recorded.
Submission rules: You
may either scan your handwritten solutions and then save them in pdf format, or
you may type them and then directly save in pdf format. Any readable and
reasonably organized submission will be accepted. You are allowed to mix handwritten
and typed ingredients as long as you submit one pdf file.
Due date adjustments: Students
who cannot adjust to time constraints indicated in the announcements section
should contact the instructor early in advance and discuss their availability.
Final Exam, Quizzes 7-9, Homework Assignments
6-7
Quiz 7, available at
noon 03/06/14, covers 7.1-7.2, due midnight 03/09/14
Practice problems
3rd edition: 7.1-7.4, 7.6, 7.8-7.10, 7.13, 7.15
2nd edition: 7.1-7.4, 7.6, 7.8-7.10, 7.12, 7.14
Homework 6 due midnight 03/12/14
Textbook problems
3rd edition: 7.8-7.10, 7.13
2nd edition: 7.8-7.10, 7.12
Quiz 8, available at noon 03/13/14, covers 7.3-7.4, Solutions of Quiz 8
problems
Practice problems
3rd edition: 7.5, 7.7, 7.12, 7.16-7.17, 7.19-7.23
2nd edition: 7.5, 7.7, 7.11, 7.15-7.16, 7.18-7.22
Homework 7 due midnight 03/19/14 (you are
allowed to use the results of 7.5 as the ingredients of your solutions)
Textbook problems
3rd edition: 7.5, 7.7, 7.12, 7.20
2nd edition: 7.5, 7.7, 7.11, 7.19
Final Exam, available from noon 03/20/14, 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, due midnight
03/23/14
Problem part of the
final exam (120 minutes) 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 (60 minutes)
will consist of six questions about theorems and their 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