Back to the 2025 paper
Similar questions
Design & Analysis of AlgorithmsDiscuss the average, worst, and best time complexity of the algorithm. Give suitable examples.20237mDesign & Analysis of AlgorithmsAn algorithm is made up of two independent time complexities f(n) and g(n). Then the complexity of the algorithm is in order of: - (i) f(n) \times g(n) - (ii) \max(f(n), g(n)) - (iii) \min(f(n), g(n)) - (iv) f(n) + g(n)20232mDesign and Analysis of Algorithms What is minimum spanning tree (MST)? Explain the steps of Prim's algorithm to find the MST using an example.20237mDesign and Analysis of Algorithms An algorithm is made up of two independent time complexities f(n) and g(n). Then the complexities of the algorithm is in the order of (i) f(n) \times g(n) (ii) \max \{ f(n), g(n) \} (iii) \min \{ f(n), g(n) \} (iv) f(n) + g(n)20222m