[Jan 24] The graded finals are available in Soda 385.
Ask Sue DeVries or Cindy Palwick to show you your exam.
[Dec 24] The results for CS172 have been determined.
You can email me (WvD) if you want to know your final grade.
Final Info
Place and time: Thursday 20 December, 12:30-3:30pm; 3106 Etcheverry
Material: Sipser Chapters 0 - 8.3 (up to the PSPACE-completeness of TQBF)
+ Handout on Kolmogorov Complexity (see week 8) + Slides week 0 - 13.
You can skip the material that we did not cover in class, which are:
the proof that CFL = pushdown automata (Section 2.2),
linear bounded automata (Section 5.1), and the Post correspondence problem
(Section 5.2).
For the following topics we will only assume that you are familiar with them,
not that you know all the ins and outs:
pushdown automata (Section 2.2), decidability of logical theories (Section 6.2),
Turing reducibility (Section 6.3), and space complexity (Chapter 8).
As a rule-of-thumb you can look at the homework questions to see
how important the different topics are.
Approximately one-third of the exam will be about pre-midterm material (Chapter 0-4),
two-thirds about the rest (Chapters 5-8.3).
Important: The final is open book and you are also allowed to use
other books, print-outs of the slides, your own notes, et cetera.
Computers are -of course- not allowed. Do not forget to bring your own scrap paper.
The level of difficulty will be comparable with the midterm,
but there will be more questions this time.
Scoring 'five' on your homework does not mean that you did everything perfectly.
Look at the homework solutions on this site for the (near) ideal way of
answering questions.
Remember that this final will determine 50% of your grade.
Review session: Allison will be holding a review session for the final on Monday
Dec 17, in 320 Soda from 6 to 8 pm.
Announcements
[Dec 17] Solutions of week 12.5 posted.
[Dec 12]
Allison will be holding a review session for the final on Monday
Dec 17, in 320 Soda from 6 to 8 pm.
[Dec 12] The last homework assignment has been graded; you can collect it
at AC's office (311 Soda).
[Dec 10] I posted the proof that primality is in NP (see week 14). Note
that this is not material for the final.
[Dec 7] Here is an old exam
(PS /
PDF) for
practice purposes, and here are its answers
(PS /
PDF).
Note however that the exam of the 20th will have more questions than this one.
[Nov 28] Solutions of weeks 9 and 11.5 posted.
[Nov 28] Lecture notes of Wednesday November 28 posted.
[Nov 26] Lecture notes of Monday November 26 posted.
[Nov 26] Last homework assignment posted (due Monday December 3).
[Nov 25] The course surveys of CS172 will be handed out at the end of the
lecture of Wednesday November 28.
[Nov 19] Slides of week 12 posted.
[Nov 16] The date of the final exam remains unchanged: Thursday
December 20.
[Nov 16] Homework of week 11.5 posted. This assignment is due Monday
November 26.
[Nov 15] Problems with web-site resolved; lecture notes of week 11 posted.
[Nov 7] Homework of week 10 posted.
[Nov 5] Wednesday November 7 AC (instead of WvD) will lecture. Also, WvD's
officice hour is cancelled on this day.
[Nov 5] Slides of Monday November 5 posted.
[Nov 5] Slides of week 9 corrected (including homework questions).
[Nov 2] Homework solutions of week 8 posted.
[Oct 31] Please email WvD (vandam@cs.berkeley.edu) the dates in the week
of December 10-14 that are possible as a final exam day for you. (If you have
not already done so for the homework of week 8.)
[Oct 31] Slides and Homework of week 9 posted.
[Oct 25] The statistics of the midterm have been calculated: the average
number of points is 39.7 (with a standard deviation of 13.8) and the median is
35.5. Click here to
see how many students got how many points.
[Oct 25] The offices of WvD and AC have moved: AC is now in 311, WvD in
583.
[Oct 24] Slides and Homework of week 8 posted.
[Oct 18] There is no homework for week 7. However, I do recommend some
reading (see below).
[Oct 16] Allison's review session on Tuesday October 16, is at 7pm in 310
Soda. Bring questions.
[Oct 10] Slides of week 6 posted.
[Oct 10] Note that there will be no class on Wednesday November 21.
[Oct 10] Homework solutions of week 5 posted.
[Oct 8] Homework solutions of week 4 posted.
[Oct 5] Slides (week 5) posted in ps format and pdf.
[Oct 4] Slides posted in Powerpoint format, not yet in ps or pdf,
[Oct 3] Homework (of week 4) will be available for pick up after 12:30 on
Thursday, October 4 at AC's office.
[Sep 26] Latest slides, homework (week 4) and homework solutions (week 3)
are posted.
[Sep 25] Monday October 1, WvD, instead of AC, will be giving the
discussion session at 310 Soda, 10am. AC will hold an extra optional section
on Wednesday October 3, at 10am in 320 Soda Hall.
[Sep 25] Wednesday September 26: WvD's office hour is cancelled.
[Sep 19] Slides and homework of week 3 posted.
[Sep 19] Homework solutions of week 1 and week 2 posted.
[Sep 19] Reminder: Monday's discussion sessions are in 310 Soda.
[Sep 16] No class next Monday. Monday 17 September, there will be a campus-wide
memorial service to commemorate the events of Tuesday the 11th. As a
result, there will be no 1-2:30pm class. Please consider attending the
ceremony, or paying tribute in your own way.
[Sep 16] Note on natural numbers: When I (WvD) write N, I mean the
set {0,1,2,...}, Sipser and AC use the other convention that N does not
contain the number zero.
[Sep 12] Latest slides and homework posted.
[Sep 10] This week's homework mentioned on this site.
[Sep 10] I contacted the Cal bookstore, they told me that they will have
Sipser tomorrow, the 11th, on shelf. Let me know (via email) when there are
any further problems.
[Sep 10] Slides of Lecture 2m added.
[Aug 30] The additional discussion section on Wednesday September 5, 10am,
will be in 373 Soda.
[Aug 30] The Cal bookstore told me that they have Sipser on the shelf.
[Aug 29] Homework and slides posted, see below. Comments and suggestions
about the slides are encouraged.
[Aug 29] There will be an added discussion section on Wednesday September
5 at 10am, room TBA.
[Aug 29] A copy of Sipser and Lewis/Papadimitriou is on reserve in the
Kresge Engineering library. This means that you can read it there for two
hours.
[Aug 27] For those with questions about the enrollment: please contact
Michael-David Sasson (msasson@cs.berkeley.edu, 379 Soda,
phone: 3-6002). The deadline to submit your appeal form to the CS office in
390 is 5pm Friday August 31. You can get those forms at the CS office for
students.
Allison Coates allisonc@cs.berkeley.edu Office hours: Tuesday 2-3pm, 311 Soda (other times by
appointment)
Textbooks:
[Required] Sipser, Michael, Introduction to the Theory of
Computation. PWS Publishing Company, 1997. [ website ] [ errata ]
(Both first and second printing are okay.)
[Additional] Lewis, Harry R., and Papadimitriou, Christos H., Elements
of the Theory of Computation, 2nd ed. Prentice-Hall, 1997. [ errata ]
Grading/Exams:
30% - Homework (one will be dropped)
20% - Midterm (Wednesday October 17 2001, in class)
50% - Final (Thursday December 20 2001, 12:30-15:30, 3106 Etcheverry)
Wednesday 1-2:30pm: class (306 Soda) / homework due before class
Wednesday 3-4pm: office hour WvD (665 Soda) / new homework announcement on
this web-site
Contacting/Questions:
I prefer that you use my office hours for your questions, rather than
doing a lengthy Q&A exchange via email. Ideally, you could email me about
the issue in advance so that I can look into it before my office hour session.
Thanks. (WvD)
Homework
Note: You do not have to turn in answers to the "practice problems";
these are only provided for you to get a better understanding of the material.
Homework: 7.1, 7.7, 7.9, 7.11, and the following one. Let G be a
directed graph of n vertices. How many bits do you need to describe G? Also,
how many bits (again as a function of n) do you need to describe a
permutation of the vertices of G? (Your answer should use the big-O
notation; but not O(n^4) if you can make it O(n^3).)
Homework: Let k-CLIQUE be the language {<G> | G is a graph with a
k-clique}. Show that for every fixed k, k-CLIQUE is in P. Prove
problem 7.21 by giving a poly-time reduction from CLIQUE to
HALF-CLIQUE. Problems 7.29 and 7.37.
Homework: Show that if P=NP, then, given a graph G that is
in HamPath, we can determine a Hamiltonian path in this G in polynomial
time. Exercise 7.8 and Problems 7.15 and 7.16.
