[Thu Apr 07 14:50 2011]
In question #3 of
Homework 9, the graph does not include
yourself. In particular, you do have the option of spreading the rumor by
personally telling every vertex in the graph. However, the only case where
this is the smallest set of people to tell is when the graph has no edges
[Tue Apr 05 15:30 2011]
Here are the notes I did not get to use today (Tuesday 4/5)
because of projector problems:
12.2 Depth-First Search.pdf.
We will finish up strongly-connected components on Thursday.
[Tue Mar 15 13:50 2011]
For Question #2 of Homework 7, duplicate
songs do not count. I.e., the solution is not recording the shortest song
over and over again.
[Tue Mar 15 11:35 2011]
Second set of dynamic programming notes for lecture on Tuesday, March 15:
10.2 Dynamic Programming 2.pdf.
We did not do the beer/milk run problem in class. You can try it for practice.
[Tue Mar 08 13:05 2011]
Question #3 on Homework 6
was replaced by a different problem. On the original Investment Strategy
problem, it is unclear what happens if you don't have enough money in your
investment account to cover the fees. Presumably, your account is closed
and you might owe some money. In any case, this makes the investment
strategy depedent on the dollar amount of the investment, resulting in a
poor dynamic programming problem.
[Wed Dec 31 19:00 1969]
In Homework 4, Question #2,
note that you cannot compare two jugs of the same
color. You can only compare a blue jug to a red jug. You cannot compare
two blue jugs or two red jugs. This is an important part of the question.
[Tue Feb 22 06:34 2011]
No class today, February 22, due to delayed opening (snow).
The following adjustments are made on the syllabus: