Home Work 4

Covers Chapters 3 and 4 of DG and CLRS Relavant chapters. Do any of the six problems. Due on 4/2/2015
  1. Do exercise 3.15 (DG) - pseudocode will suffice
  2. Do exercise 3.17 (DG) - pseudocode will suffice.
  3. Do problem 3.22 (DG)- pseudocode will suffice
  4. Do exercise 3.24 (DG) - pseudocode will suffice. (Hint:Find the longest path from the source vertex - Bigger Hint: Do a topological sort of this Directed Acyclic Graph. Check for successive vertices (u and v) in the topological sort, there is a directed edge from u to v. Give reasons why it should be the case )
  5. Do Problem 22.3-8 (page 611 CLRS 3rd Edition) The actual problem statement is : Give a counterexample to the conjecture that if a directed graph G contains a path from u to v, if u.d < v.d (i..e, the pre number of u is less than pre number of v) in a depth first search of G, then v is a descendant of u in the depth first traversal of G.
  6. Do Problem 4.3 (DG)
  7. Do Problem 4.4 (DG)
  8. Do Problem 4.7 (DG)
  9. Do Problem 4.8 (DG)
  10. Do Problem 4.9 (DG)