Back to the 2019 paper
Module 3: Greedy, Dynamic Programming and Other Paradigms
201914m
What do you mean by optimal solution in greedy approach? Define the properties and function of greedy approach. Consider the graph given below. Find the minimum spanning tree by Prim's algorithms.
This question has repeated before
Also appeared in 2022.
Similar questions
Design & Analysis of AlgorithmsWhat do you mean by optimal solution in greedy approach? Define the properties and function of greedy approach. Consider the graph G=(V, E) given below. Find the minimum spanning tree by Prim's algorithms. 202214mDesign & Analysis of AlgorithmsKruskal's Algorithm for finding the Minimum Spanning Tree of a graph is a kind of a? - (i) DP Problem - (ii) Greedy Algorithm - (iii) Adhoc Problem - (iv) None of the above20242mDesign & Analysis of AlgorithmsConstruct minimum cost spanning tree using Kruskal's algorithm 20247mDesign and Analysis of Algorithms Which algorithm is used to find a Minimum Spanning Tree? (i) Dijkstra's algorithm (ii) Prim's algorithm (iii) Bellman-Ford algorithm (iv) Floyd-Warshall algorithm20242m
PreviousConsider the array A = \{26, 17, 41, 14, 21, 30, 47, 10, 16, 19, 21, 28, 38, 7, 12, 14, 20, 35, 39, 3\}. Create binary search tree with one more attribute its size of node. Retrieve 17th smallest element in the tree and rank the 12th element.NextExplain back-tracking, DFS and BFS with help of small example. Differentiate in between backtracking and dynamic programming. Apply the backtracking algorithm to solve the three-colouring problem for the following graph using state space tree. Assume three colours red, green and blue. 