My cs502 paper
(1)How kruskul algorithm works 3mrks
(2) Explain the following two basic cases according to
Floyd-Warshall Algorithm, 3mrks
1. Don’t go through vertex k at all.
2. Do go through vertex k
(3)how many basic
cases according to Floyd-Warshall Algorithm,? 2mrks
(4) drive a formula to calculate a cost of encoded tree
T?
(5)kruskul algoritm running time when its sparse? 3mrks
(6) a tree was given we have to find MST 5mrks
(7) a matrix is given we have to find adjacency list
5mrks
(8) why we need a reduction,give one example 5mrks
Comments
Post a Comment
Please give us your feedback & help us to improve this site.