Back to the 2022 paper
Similar questions
Design & Analysis of AlgorithmsExplain the working of merge sort algorithm with an example. Give the complexity calculation of merge sort.20227mDesign & Analysis of AlgorithmsWrite Divide - And - Conquer Quick sort algorithm and analyze the algorithm for average time complexity.20247mDesign & Analysis of AlgorithmsWhat are the advantages of merge-sort over the quick-sort algorithm?20197mDesign & Analysis of AlgorithmsThe minimum number of comparisons required to determine if an integer appears more than n/2 times in a sorted array of n integers is - (i) O(n) - (ii) O(\log n) - (iii) O(n \log n) - (iv) O(1)20242m
PreviousWhich of the following algorithm solves the All Pair Shortest Path problem (i) Dijkstra's (ii) Floyd's Warshall's (iii) Prim's (iv) Kruskal'sNextWhich 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 these