Analysis and Design of Algorithms 2a. - Vtustudentsparadise

2 of?06cs,6a. Apply Warshall's algorithm tofollowing adjacency matrix:(oll, olo ob.[ooUsing Floyd's algorithm, solveweight matrix is given below:Using Kruskal's algorithm,given below:06cO@Jobtainfind the transitive closure00\I 0lo tl0o)the all-pairs shortest path2@l032oo0 4a208@@Joo@@ 0a minimumof the graph defined by t(05 Marproblem for the graph whr(10 Marcost spanning tree for the graph Fig.Q((05 MarFig.Q6(c)7 a. Construct a Huffrnan code for the following data: (06 MaCharacter A B C D EProbabilitv 0.4 0.1 0.2 0.15 0.15Decode the text whose encoding is 100010111001010 using the above Huffinan code.b. Write short notes on P, NP and NP-complete problems. (06 Mac. Explain how backtracking is used for solving 4 -8a. Solve the fibllowine insknce ofem lgngItem I 2 3 4Weieht 4 7 5 3Value $40 $42 $2s $i2b.The capacity of the knapsack iJ$i: l0.queens problem. Show the state space tr(0E Mabranch and bound algorithm:(08 MaWhen does collision occur in hashing? What are the different mechanisms used to resrcollisions?(04 MaWhat are decision trees? Explain how decision trees are used in sorting algorithms.,^ _ _ (08 Ma***,1.*