Time Left - 10:00 mins

ISRO 2018: Algorithms Booster Quiz- 3

Attempt now to get your rank among 879 students!

Question 1

Which of the following Algorithms design techniques is used in merge sort?

Question 2

Consider the following program fragment
if(a>b)
if(b>c)
s1;
else s2;
s2 will be executed if

Question 3

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

Question 4

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

Question 5

Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?

Question 6

Consider a 13 element hash table for which f(key) = key mod 13 is used with integer keys. Assuming linear probing is used for collision resolution, at which location would the key 103 be inserted, if the keys 661, 182, 24 and 103 are inserted in that order?

Question 7

Selection sort algorithm design technique is an example of

Question 8

Suppose there are eleven items in the sorted order in an array. How many searches are required on the average, if binary search is employed and all searches are successful in finding the item?
  • 879 attempts
  • 3 upvotes
  • 12 comments
Apr 3GATE & PSU CS