1
GATE CSE 2005
MCQ (Single Correct Answer)
+2
-0.6
Let G(V, E) an undirected graph with positive edge weights. Dijkstra's single-source shortest path algorithm can be implemented using the binary heap data structure with time complexity:
2
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
The elements 32, 15, 20, 30, 12, 25, 16, are inserted one by one in the given
order into a max Heap. The resultant max Heap is
3
GATE CSE 1999
MCQ (Single Correct Answer)
+2
-0.6
If T1 = O(1), give the correct matching for the following pairs:
(N) Tn = Tn/2 + n
(O) Tn = Tn/2 + nlog n
(P) Tn = Tn - 1 + log n
(V) Tn = O(nlogn)
(W) Tn = O(n2)
(X) Tn = O(log2n)
List - I
(M) Tn = Tn - 1 + n(N) Tn = Tn/2 + n
(O) Tn = Tn/2 + nlog n
(P) Tn = Tn - 1 + log n
List - II
(U) Tn= O(n)(V) Tn = O(nlogn)
(W) Tn = O(n2)
(X) Tn = O(log2n)
4
GATE CSE 1996
MCQ (Single Correct Answer)
+2
-0.6
The minimum number of interchanges needed to convert the array
89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70
into a heap with the maximum element at the root isQuestions Asked from Searching and Sorting (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2021 Set 1 (1)
GATE CSE 2018 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2015 Set 1 (1)
GATE CSE 2009 (2)
GATE CSE 2008 (1)
GATE CSE 2007 (1)
GATE CSE 2006 (3)
GATE CSE 2005 (2)
GATE CSE 2004 (1)
GATE CSE 1999 (1)
GATE CSE 1996 (2)
GATE CSE 1994 (1)
GATE CSE 1992 (1)
GATE CSE 1991 (1)
GATE CSE 1990 (2)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages