October 26, 2023
Question 26 What is the solution to the recurrence T(n)=T(n/2)+n? A O(log n) B O(n) C O(n logn) D None of these AlgorithmsAsymptotic-ComplexityNielit Scientist-B CS 4-12-2016 […]
October 26, 2023
Question 21 The solution of the recurrence relation T(m)=T(3m/4)+1 is : A θ(lg m) B θ(m) C θ(mlg m) D θ(lglg m) AlgorithmsAsymptotic-Complexity Question 21 Explanation: […]
October 26, 2023
Question 2 Which of the following statement is false about Prim’s algorithm? A Initially the roots key and nodes are initialized to zero B It may […]
October 26, 2023
Question 5 When using Dijkstra’s algorithm to find shortest path in a graph, which of the following statement is not true? A It can find shortest […]