This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ____________________________________ ____________________________________ Discussion Section: M 12:30 1:30 (Roberson) M 1:30 2:30 (Roberson) M 3:30 4:30 (Muthukrishnan) F 12:30 1:30 (Singh) F 1:30 2:30 (King) F 2:30 3:30 (King) F 3:30 4:30 (Muthukrishnan) Note that this homework is due on Monday, a day earlier than usual! Section 9.4 1. (E) 12ab 2. (E) 14bc 3. (M) 26 (Assume that the graph is undirected.) 4. (C) 54 Section 9.6 5. (E) 2 (Use Dijkstra's algorithm to find the shortest path from a to z. Note that your solution should be in the same format as Figure 4 on page 652 in the book. You have to show the tables corresponding to every step of the algorithm, as in Figure 4. ) 6. (E) 14 7. (E) 18 8. (M) (Easy Points!) EVERY one of your group members should complete course evaluations for their lecture AND discussion section. Print and attach the confirmation pages to your homework. Do NOT attach the full evaluation itself....
View
Full
Document
This note was uploaded on 02/12/2012 for the course EECS 203 taught by Professor Yaoyunshi during the Spring '07 term at University of Michigan.
 Spring '07
 YaoyunShi

Click to edit the document details