Question: solve q2 please Q1. (CLOS-5)Apply Dijkstra, Prim, Kruskal Algorithms on the following graphs, Starting with vertex :A: His destination in graph given below. (2+2+2 Marks)

solve q2 please
Q1. (CLOS-5)Apply Dijkstra, Prim, Kruskal Algorithms on the following graphs, Starting with vertex :A: His destination in graph given below. (2+2+2 Marks) B D 00 E F G 5 #2. (CLOS-5) Apply DFS and BFS algorithms and starts from vertex 'a' sequence of search. (2+2 Marks) b e g. h Q#3. (CLOS-4) Quick-sort perform on arr[ ]={15,13,12,23,31,11,3,5,7,2,1,6,8,10,4). Number of Division performed on this array. Solve the complexity of quick sort through substitution of average, worse and best. (Marks 5) Q44. (CLOS-4) Construct a heap of 12 elements for the list 8,15, 30, 17,1,2, 8, 6, 5, 13, 7,4 by the and Min heap algorithm by bottom-down-approach and sort them. (Marks 5) Q#5. (CLOS-5) Apply the dynamic programming algorithm to the following instance of the LCS problem. (Marks 5) X=GACATUA Y=ACGATCGU
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
