Time Left - 15:00 mins

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

Attempt now to get your rank among 250 students!

Question 1

The tightest lower bound on the number of comparisons, in the worst case, for comparison-based sorting is of the order of

Question 2

The Keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially hash table of length 10 using open addressing with hash function h (K) = k mod 10 and linear probing. What is the resultant hash table?

Question 3

From the types of sort given below choose the sort from which we get best average behavior

Question 4

The graph shown below has distinct edge weights and MST of weight 40 and MST contain edges

{(A, C), (B, C), (B, E), (E, F), (D, F)}. The minimum possible sum of weights of all 8 edges of this graph is _____.

Question 5

Given below three graphs G1, G2 and G3 The number of bridges in G1, G2 and G3 are x, y and z respectively. Find the value of |x-y+z| ____________.

Question 6

Given a disconnected graph on 10 vertices, what is the max number of edges it can have ________.
  • 250 attempts
  • 1 upvote
  • 2 comments
May 9GATE & PSU CS

Posted by:

Harshita AgarwalHarshita AgarwalMember since Jul 2020
Share this quiz   |