Question: question on ALGORITHM ANALYSIS AND DESIGN 15. (a) State the differences between PRIM's and KRUSKAL's algorithm for Minimum spanning tree problem. (b) In case of

question on ALGORITHM ANALYSIS AND DESIGN question on ALGORITHM ANALYSIS AND DESIGN 15. (a) State the differences

15. (a) State the differences between PRIM's and KRUSKAL's algorithm for Minimum spanning tree problem. (b) In case of Max-Heap, write the algorithm for "Max heapify(A, i) and Build max heap (A), where A is the array and i is the index of the node. You must analyse the time complexity also. (C) Design a dynamic programming to solve the convex polygon triangulation such that the sum of the perimeters of all the triangles in a triangulation become minimum

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!