Background: Ch. 25.1, 25.2, 16.1, 16.2, 16.3.
Due December 11th:
- 11.1: Let's say you are throwing a party. Your house is a node in
a directed graph. Explain how you'd use an algorithm for
single-source shortest paths to compute directions for all the other
nodes of the graph (single-destination shortest paths).
- 11.2: Give an example of a graph for which the shortest-path tree
and the minimum spanning tree are different.
- 11.3: A
example... zzz (still waiting on this one...) - 11.4: Modify MAXPROB to print the most likely sequence of
words. Give the running time for this operation.
- 11.5: Modify MAXPROB to return the probability of
all word sequences consistent with s (Extra credit).
- 11.6: Solve: T(1) = 1,
. - 11.7: CLR Exercise 16.3-5 (pg. 319).
- 11.8: CLR Problem 16-3 (pg. 325).
Up: HOMEWORK
Previous: HOMEWORK