Question 26 Which of the given options provides the increasing order of asymptotic complexity of functions f1, f2, f3 and f4? f1(n)=2n f2(n)=n3/2 f3(n)=n log2 n […]

Question 20 Assume that f(n) and g(n) are asymptotically positive. Which of the following is correct? A f(n)=O(g(n)) and g(n)=O(h(n))⇨ f(n)=ω(h(n)) B f(n)=Ω(g(n)) and g(n)=Ω(h(n))⇨ f(n)=O(h(n)) […]

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:  […]