Time Left - 05:00 mins

NIELIT Scientific / Technical Assistant-A Daily Quiz-2 (Algorithms)

Attempt now to get your rank among 504 students!

Question 1

Consider the following functions:

Which of the following statements about the asymptotic behaviour of f(n), g(n), and h(n) is true?

Question 2

In a bubble Sort, worst-case runtime complexity will be:

Question 3

Which of the following sorting algorithms has the lowest worst–case complexity?

Question 4

In the spanning tree shown, what will be the minimum cost?

Question 5

The Breadth First Search algorithm has been implemented using the queue data structure. One possible order of visiting the nodes of the following graph if Q is starting node.

504 attempts
5 upvotes
12 comments

Tags :

GATE & PSU CS Algorithms

Jun 25GATE & PSU CS