Time Left - 12:00 mins

Algorithm : Nuclear Quiz 3

Attempt now to get your rank among 230 students!

Question 1

Consider an array contain n distinct elements. In array till ‘i’ location element are in increasing order and after ‘i’ location all elements are in decreasing order. What is the time complexity to find location of i^th element?

Question 2

Which of the following is a disadvantage of linear search?

Question 3

How many passes of bubble sort are required to sort the following sequence (Pass is counted only when at least one swap is performed in the bubble sort pass)?

12, 15, 17, 11, 14, 13

Question 4

What is the formula used in quadratic probing?

Question 5

Given a hash table T with load factor 80 that stores 2000 elements, the number of slots is _________

Question 6

The average search time of hashing, with linear probing will be less if the load factor:

Question 7

Find the number of spanning trees for the following graph : _______

Question 8

Consider a complete graph G with 4 vertices. The number of spanning trees possible for graph G.

Question 9

Consider the following two claims

I. 3ⁿ⁺¹ = O(3ⁿ)

II. 4³ⁿ⁺¹ = O(4ⁿ)

Which of the claims is/are incorrect?

Question 10

What is the time complexity of the following segment?

for (i = 1; I < = n; ++i)

{

For (j = 1; j * j < = n; ++j)

c++;

}

230 attempts
1 upvote
4 comments

Tags :

GATE & PSU CS Algorithms

Jul 22GATE & PSU CS