1

GATE CSE 2005

MCQ (Single Correct Answer)

+2

-0.6

A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order traversal of the heap is given below:

10, 8, 5, 3, 2

Two new elements '1' and '7' are inserted in the heap in that order, The level order traversal of the heap after the insertion of the elements is:

10, 8, 5, 3, 2

Two new elements '1' and '7' are inserted in the heap in that order, The level order traversal of the heap after the insertion of the elements is:

2

GATE CSE 2005

MCQ (Single Correct Answer)

+2

-0.6

Consider the following C - function:

```
double foo(int n){
int i;
double sum;
if(n == 0) return 1.0;
sum = 0.0;
for (i = 0; i < n; i++){
sum += foo(i);
}
return sum;
}
```

The space complexity of the above function is:3

GATE CSE 2004

MCQ (Single Correct Answer)

+2

-0.6

What does the following algorithm approximate?

(Assume m > 1, $$ \in > 0$$)

(Assume m > 1, $$ \in > 0$$)

```
x = m;
y = 1;
while(x - y > ε){
x = (x + y) / 2;
y = m/x;
}
print(x);
```

4

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 isQuestions Asked from Complexity Analysis and Asymptotic Notations (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2023 (1)
GATE CSE 2021 Set 1 (2)
GATE CSE 2019 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2015 Set 1 (2)
GATE CSE 2013 (1)
GATE CSE 2011 (1)
GATE CSE 2008 (5)
GATE CSE 2007 (3)
GATE CSE 2005 (3)
GATE CSE 2004 (4)
GATE CSE 2003 (1)
GATE CSE 2002 (2)
GATE CSE 2000 (1)
GATE CSE 1994 (1)
GATE CSE 1993 (1)
GATE CSE 1990 (1)
GATE CSE 1987 (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