1
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
Let A[1,...,n] be an array storing a bit (1 or 0) at each location, and f(m) is a function whose time complexity is O(m). Consider the following program fragment written in a C like language:
counter = 0;
for(i = 1; i <= n; i++){
 if(A[i]==1){
   counter++;
 }else{
   f(counter); counter = 0;
 }
}
The complexity of this program fragment is
A
$$\Omega ({n^2})$$
B
$$\Omega (n\,\log n)\,and\,O({n^2})$$
C
$$\theta (n)$$
D
$$O(n)$$
2
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
The time complexity of the following C function is (assume n > 0)
int recursive(int n){
 if(n == 1){
   return (1);
 }
 return (recursive(n - 1) + recursive(n - 1));
}
A
O(n)
B
O(n log n)
C
O(n2)
D
O(2n)
3
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
The recurrence equation
T(1) = 1
T(n) = 2T(n - 1)+n, $$n \ge 2$$
Evaluates to
A
2n+1 - n - 2
B
2n - n
C
2n+1 - 2n - 2
D
2n + n
4
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
A
GATE CSE 2004 Algorithms - Searching and Sorting Question 22 English Option 1
B
GATE CSE 2004 Algorithms - Searching and Sorting Question 22 English Option 2
C
GATE CSE 2004 Algorithms - Searching and Sorting Question 22 English Option 3
D
GATE CSE 2004 Algorithms - Searching and Sorting Question 22 English Option 4
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12