![GATE 2014 [Set-2]](https://solutionsadda.in/wp-content/uploads/2019/05/green-new-logo.png){kind=logo}
April 3, 2025
Question 62 The number of distinct minimum spanning trees for the weighted graph below is _______. A 6 B 7 C 8 D 9 AlgorithmsMinimum-Spanning-TreeVideo-Explanation Question […]
April 5, 2025
Question 19 What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices? A Θ(n2) B Θ(n2 log n) […]
April 5, 2025
Question 31 The number of elements that can be sorted in Θ(log n) time using heap sort is A Θ(1) B Θ(√logn) C Θ (logn/loglogn) D […]
April 5, 2025
Question 12 The running time of quick sort algorithm depends heavily on the selection of: A No. of inputs B Arrangement of elements in an array […]