Back to the 2022 paper
Similar questions
Design & Analysis of AlgorithmsWrite short notes on: Kruskal algorithms.20197mDesign & Analysis of AlgorithmsThe approach followed in Floyd Warshall's algorithm is - (i) Greedy approach - (ii) Dynamic approach - (iii) Backtracking - (iv) Divide and conquer20242mDesign and Analysis of Algorithms Differentiate between divide & conquer, greedy method and dynamic programming with suitable examples.20227mDesign & 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 above20242m
PreviousWhich one of the following statement is correct? (i) If A \le_p B and B \in P then A \in P (ii) If A \le_p B and $A otin P then B otin P$ (iii) If A \le_p B and B \le_p C then A \le_p C (iv) All of theseNextSolve the following recurrence by successive substitution method: f(1) = 1 \quad \text{if } n=1 f(n) = 3f(n/2) + 6 \quad \text{if } n > 1