Time Left - 15:00 mins
GATE CS 2021 : Algorithm Rapid Quiz 2 (App update required to attempt this test)
Attempt now to get your rank among 700 students!
Question 1
Which of the following is correct?
Question 2
The concept of order Big O is important because :
Question 3
In a bubble Sort, worst-case runtime complexity will be:
Question 4
The worst case running time of Insertion sort, Merge sort and Quick sort, respectively, are:
Question 5
Transpose of a matrix must be calculated for which of the following algorithm that uses DFS?
Question 6
Find the number of valid DFT of following GRAPH :
i). C A B G E F D
ii). C A B F E G D
iii).C B A D E G F
iv).C B A D G F E
- 700 attempts
- 4 upvotes
- 11 comments
Tags :
GATE & PSU CSAlgorithmsMay 4GATE & PSU CS