My message about tutorial 3 seems to have gotten lost.  I'll try to
quickly recreate the important points here.
I think Shlomi should make another pass addressing these comments, and
then pass it on to George for solutions.

It's too long as is.  I suggest:

Include Problem 1 (allow enough time, though)

Skip problem 2---too repetitive of lecture.

Include 3, but change the final line to:
``Prove by (strong) induction that the ``binary search'' procedure
sets ``location'' to an index i such that ai = x, if there is such an
index, and otherwise sets ``location'' to 0.''

Problem 4:
Break up into two problem.
Include both.

Skip 5 (done in lecture)

For 6, I wrote a long elaborate discussion of the pros and cons and
possible changes.  Shlomi, let's talk about this in person or on the
phone---I don't want to write it all up again.
Basically, the lecture covers the general theory, so this problem
should deal with the specific DAG only.  The questions should only ask
about this DAG, not about general DAGs.
E.g., ask
(a) What's the length of a critical path; find such a path. 
(b) Argue that you can't do the courses in less than this length.
(c) Argue that you can do the courses in this length.

George should check that the prereq graph is up-to-date (using the MIT
course catalog).

Miniquiz: 1.4 ex. 8; 2.3 ex. 2.
