This shows you the differences between two versions of the page.

Both sides previous revision Previous revision Next revision | Previous revision | ||

cs-236:homework-9 [2017/11/20 12:44] pjohnst5 |
cs-236:homework-9 [2018/08/15 14:34] pdiddy 8th edition |
||
---|---|---|---|

Line 16: | Line 16: | ||

# (3 points) 10.3.4 | # (3 points) 10.3.4 | ||

# (2 points) 10.3.12 | # (2 points) 10.3.12 | ||

- | # (2 points) 10.3.26 - do for Exercise 2 only (not Example 2). Use the following labels for edges: [[https://wiki.cs.byu.edu/_media/cs-236/homework9problem6.jpeg?t=1510864925&w=358&h=227&tok=02f101|graph]] | + | # (2 points) 10.3.26 (8th ed. 10.3.30) - do for Exercise 2 only (not Example 2). Use the following labels for edges: [[https://wiki.cs.byu.edu/_media/cs-236/homework9problem6.jpeg?t=1510864925&w=358&h=227&tok=02f101|graph]] |

# (4 points) 10.4.2 | # (4 points) 10.4.2 | ||

# (1 points) 10.4.4 | # (1 points) 10.4.4 | ||

Line 22: | Line 22: | ||

# (3 points) 10.4.14 | # (3 points) 10.4.14 | ||

# (2 points) 10.4.18 | # (2 points) 10.4.18 | ||

- | # (6 points) 10.6.8 use Dijkstra's algorithm to compute the actual path, and not just the mileage (show your work). Report both the mileage and the path. | + | # (6 points) 10.6.8 - Extend Dijkstra's algorithm to compute the actual path as well as the mileage. Show your work. Report both the mileage and the path. |

- | # (6 points) 10.6.21 extend the algorithm to compute the actual path, and not just the cost. Report the cost between ''a'' and ''z'' and show how the path is reconstructed from your extension. | + | # (6 points) 10.6.21 - Extend Floyd's algorithm to compute the actual path as well as the cost. Report the cost between ''a'' and ''z'' and show how the path is reconstructed from your extension. |

# ('''6 points Extra Credit''') Draw the “call graph” of the following program fragment. (The nodes of a call graph are methods and the edges are method calls) | # ('''6 points Extra Credit''') Draw the “call graph” of the following program fragment. (The nodes of a call graph are methods and the edges are method calls) | ||

## What do cycles in a call graph mean? | ## What do cycles in a call graph mean? |