-- In case you missed my emails, in question 3, P_m(i) should refer to the probability that the counter C has value i after m increments. Alternatively, it is the probability that Look(C) returns 2*i after m increments. -- I gave some broad hints for Question 5 on NP completeness in an email to the class. Please understand the proof of Lemma 4 in Lecture XXX.
(1) We get one more homework (hw5). Out by Monday, April 28. Due the following Monday. Solution will be posted, but you will only get back the graded hw on exam day. (2) On Wed April 30th, we will do a final review Please come prepared with your questions. (3) We have 2 more Monday Lectures: April 28: we will cover hashing May 5th: we will cover the traditional NP-completeness theory (4) Exam Week of May 5th: we will hold all the regular office hours plus some extra hours: Monday 5: Last Lecture on NP-completeness Tue 6: 11-12 (my regular office hour) 5-6 (extra office hour in my office) Wed 7: 3:20 - 5:00 (Igor's regular office hour) 7:00 - 8:30 (Iuliana's regular office hour) Thu 8: 6:00 - 7:30 (Igor's extra office hour) Fri 9: 6:00 - 7:30 (Iuliana's extra office hour) (5) Monday May 12: Final Exam Remember that you can prepare 2 sheets of 8"x11" notes. I will make the exam in the style of the midterm.