Time Left - 05:00 mins

ISRO Exam CS 2017 Topic-Wise Quiz Algo (Analysis of Algorithm )

Attempt now to get your rank among 1010 students!

Question 1

Consider the following recurrence
T(n) = 2T(√n)+1
T(1) = 1
Which one of the following is true?

Question 2

Access time of the symbol table will be logarithmic if it is implemented by

Question 3

Which of the following sorting algorithms have the minimum running time complexity in the best and average case respectively?

Question 4

Let T(n) be defined by T (1)= 10 and T(n +1) = 2n +T(n) for all integers n $Description: E:\Gate\isro-cs\ISRO-CS-2011_files\image016.png$ 1. Which of the following represents the order of growth of T(n) as a function of n?

Question 5

Which one of the following correctly determines the solution of the recurrence relation with $T (1) = 1$ ?

T (n) = 2 T (\frac{n}{2}) + \log n

1010 attempts
7 upvotes
17 comments

Tags :

GATE & PSU CS Algorithms

Mar 30GATE & PSU CS