Quiz 4

Question 1

Warshalls Alg transitive closure example constructing matrices (ch. 8 slides pg.43)

Question 2

Warshals alg psuedocode and analysis (ch. 8 slides pg. 45)

Question 3

Floyds Algorithm constructing matrices (ch. 8 slides pg. 49)

Question 4

Floyds Algorithm psuedocode and analysis (ch 8 slides pg. 50

Question 5

Construct the DP table for the Longest Common Subsequence probelm (ch. 8 slides pg. 70)

Question 6

LCS Length Algorithm (ch. 8. slides pg. 67)

Question 7

LCS ( tracking solution ) algorithm (ch 8. slides pg. 67)

Question 8

Construct the (tree vertices, remaining vertices table) for Pirms MST algotihm (ch. 9 slides pg. 9)

Question 9

Write the psuedocode and analysis for prims MST algorithm

Question 10

Construct the MST tree using Kruscals algorithm and calculate the cost (abdul bari, prims/krusclas vid)

whats the analsyis?

Question 11

Construct the MST tree using prims algorithm and calculate the cost (abdul bari, prims/krusclas vid)

whats the analsyis?

Question 12

Construct the (treevertices, remaing vertices) table for dijkstras alg. (ch. 9 slides pg. 22)

whats the analysis of dijkstras alg.?

Question 13

Complete the Huffmans code algorithm example from (ch. 9 slides pg. 27)

Question 14

Ex1. LP slides (pg. 4)

Question 15

Ex2. LP slides (pg. 13)