1
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
Following algorithm(s) can be used to sort n integers in the range [1....... n3] in O(n) time
A
Heapsort
B
Quicksort
C
Merge sort
D
Radix sort
2
GATE CSE 1992
Subjective
+2
-0
Assume that the last element of the set is used as partition element in Quicksort. If n distinct elements from the set [1…n] are to be sorted, give an input for which Quicksort takes maximum time.
3
GATE CSE 1992
Fill in the Blanks
+2
-0
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges if the edges are sorted is _______.
4
GATE CSE 1992
MCQ (Single Correct Answer)
+2
-0.6
Which of the following problems is not NP-hard?
A
Hamiltonian circuit problem
B
The 0/1 Knapsack problem
C
Finding bi-connected components of a graph
D
The graph coloring problem
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12