Time Left - 10:00 mins

GATE 2020 : Algorithms Quiz 1 (App update required to attempt this test)

Attempt now to get your rank among 1181 students!

Question 1

Huffman coding is an example of a?

Question 2

If f(n) = O(n) and g(n) = (n) , then what can be correct about f(n)+g(n) ?

Question 3

Given a disconnected graph on 10 vertices, what is the max number of edges it can have ________.

Question 4

What is the advantage of chaining

Question 5

In an algorithm it is assumed that P!= NP, so identify which of the following is true?

Question 6

In a bubble Sort, worst-case runtime complexity will be:
  • 1181 attempts
  • 5 upvotes
  • 4 comments
Aug 11GATE & PSU CS