Use Kruskal's algorithm to find a minimal spanning tree in the graph given below
________ _________ __________ _______ ____ ________ _______ ______ _____.
________ ________ ____ ______ ___.
________ ______ _____ ____ _________ ____ ____ ____ ___ ___ _____.
___ _____ _____ __________ ___ __________ _______ ___ ____ ____ ___ _________.
______ ___ _______ _________ ___ ____ _____ _____ _____ ________ ___ _______.
___ _________ __________ ___ ______ __________ _______ ___.
___ _________ ____ ____ ___ _________ ________ ____ _________ _______.
________ _________ _______ ___.
- Solved Assignments
- Study Notes
- Guess Papers
- Question Papers
✓ Unlock up to 60% of the answer
✓ No payment required
Find an optimal parenthesisation of a matrix chain product whose sequence of dimensions is (4,8,7,2,3).
Show the minimum heap after each of the following operations
i) Create with values 13, 46, 68, 15, 87, 4, 33, 21, 1, 79.
ii) Insertion of value 9.
iii) Update of value 1 by 71.
With the help of an example, explain the following:
i) Algorithm,
ii) Input and output for an algorithm
iii) Running time of an algorithm (5)
b) Illustrate the operations of partition in quick sort on the array
.
Show step by step how the merge procedure of merge sort will merge the arrays ,1 ,3 ,4 ,7 11,9 13, 14, and ,2 ,5 ,6 10,8 12, .
Use Dijkstra's algorithm to find the shortest paths in the graph given below with a as the source vertex.
Show step by step how you will construct a binary search tree by inserting keys in the order 12, 6, 4, 7, 8, 10, 7, 5, 13, 16, 11, starting from an empty binary tree. Explain step by step how you will delete the node with the key 13 from the binary tree. (5)
b) Illustrate the operations of performing counter sort on the array .
For the following set of points, describe how the CLOSET-PAIR algorithm finds a closest pair of points:
(1,2),(2,−1),(3,−3),(3,2),(−3,4),(−1,2),(2,3),(1,1),(−5,−2).