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 […]
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: […]
Question 8 Consider the following Adjacency matrix corresonding to some weighted Graph ‘G’. What is the weight of the minimum spanning tree for the graph ‘G’? […]
Question 11 Which of the following algorithms is fastest to find shortest path from a source node to a destination node in an un-weighted connected graph? […]
Question 97 Selection sort algorithm design technique is an example of A Greedy method B Divide-and-conquer C Dynamic Programming D Backtracking AlgorithmsSortingISRO-2007 Question 97 Explanation: The […]
Question 101 Which of the following sorting algorithms uses recursion? A Insertion sort B Heap sort C Merge sort D Bubble sort AlgorithmsSortingKVS DEC-2017 Question 101 […]