Homework 11: Final (incomplete)

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: Given an online map of Romania, and the straight-line distance heuristic, show how A would lead you from Arad to Bucharest (Extra credit).
11.4: CLR Exercise 16.3-1 (pg. 319).
11.5: CLR Exercise 16.3-5 (pg. 319).
11.6: CLR Problem 16-3 (pg. 325).
11.7: Modify MAXPROB to print the most likely sequence of words. Give the running time for this operation.
11.8: Modify MAXPROB to return the probability of all word sequences consistent with s (Extra credit).
11.9: Solve: T(1) = 1, .

$next$ $up$ $previous$
Up: LONGEST COMMON SUBSEQUENCE Previous: Memoization