Time Left - 15:00 mins

GATE CS 2022 : Algorithm -3 (App update required to attempt this test)

Attempt now to get your rank among 216 students!

Question 1

Consider a hash table with 9 slots. The hash function is ℎ(k) = k mod 9. The collisions are resolved by chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17 and 10. The maximum, minimum, and average chain lengths in the hash table, respectively, are

Question 2

What is the number of swaps required to sort n elements using selection sort, in the worst case?

Question 3

The following problems are solved using Divide and Conquer. Match these problems to their respective recurrence relation :

Question 4

The running time of an efficient algorithm to find all cut vertices of a graph

Question 5

In a depth-first traversal of a graph G with 20 vertices, 15 edges are marked as tree edges. The number of connected components in G is-

Question 6

In a complete graph K5, the number of spanning tree possible is ___
  • 216 attempts
  • 1 upvote
  • 1 comment

Posted by:

Harshita AgarwalHarshita AgarwalMember since Jul 2020
Share this quiz   |