Time Left - 10:00 mins

# IIIT Hyderabad Practice Quiz : Algorithms-2

Attempt now to get your rank among 371 students!

Question 1

Given f(n) = θ(n), g(n) = Ω(n), h(n) = O(n). Then f(n) + [g(n) h(n)] = ?

Question 2 In the above algorithm, if input data items are already in sorted order then what is the Time complexity?

Question 3

Consider the following keys that are hashed into the hash table in the order given using the hash function mod 11.
12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 5.
Assume hash table has locations from 0 to 10. If hash table uses chaining to handle the collisions, how many locations are left without hashing any element into it?

Question 4

T(N) = 2T + N if N > 1

T(N) = 1 if N = = 1.

Then, T(N) is

Question 5

If the array elements are already in the increasing order, then which of the following sorting algorithms takes worst case Time Complexity.

I. Insertion sort

II. Quick sort

III. Heap sort

• 371 attempts Member since Jul 2020 GradeStack Learning Pvt. Ltd.Windsor IT Park, Tower - A, 2nd Floor, Sector 125, Noida, Uttar Pradesh 201303 help@byjusexamprep.com