CISC 3220 - Homework #6

Due: Monday, November 14, 2011.

    Selection (Chapter 5) (These exercises include some more review of Max-heaps.)

  1. Page 244, Exercise 5.10 Explain how you derived your answer.

  2. Page 245, Exercise 5.21

    Graph Traversals (Chapter 7)

  3. Exercise 7.4 b (Since we did not specifically discuss the DFS tree, show, using the stack and the node ordering, how the algorithm would run for the given graph.)

  4. Exercise 7.5 b (same comment as in previous exercise.)

  5. 7.8 (The transpose of a graph is the graph that results from reversing the direction of each edge in the original graph).

  6. Exercise 7.17