1
GATE CSE 2003
MCQ (Single Correct Answer)
+1
-0.3
In a heap with n elements with the smallest element at the root, the 7th smallest element can be found in time
A
$$\Theta (n \log n)$$
B
$$\Theta (n)$$
C
$$\Theta(\log n)$$
D
$$\Theta(1)$$
2
GATE CSE 2001
MCQ (Single Correct Answer)
+1
-0.3
Consider any array representation of an n element binary heap where the elements are stored from index 1 to index n of the array. For the element stored at index i of the array $$\left( {i \le n} \right)$$, the index of the parent is
A
i - 1
B
$$\lfloor \frac{i}{2} \rfloor$$
C
$$\lceil \frac{i}{2} \rceil$$
D
$${{i + 1} \over 2}$$
3
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
Suppose we want to arrange the n numbers stored in any array such that all negative values occur before all positive ones. Minimum number of exchanges required in the worst case is
A
n - 1
B
n
C
n + 1
D
None of the above
4
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
The number of articulation points of the following graph is GATE CSE 1999 Algorithms - Searching and Sorting Question 45 English
A
0
B
1
C
2
D
3
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
CBSE
Class 12