1

GATE CSE 2014 Set 3

MCQ (Single Correct Answer)

+1

-0.3

Which of the following statements are CORRECT?

1) Static allocation of all data areas by a compiler makes it impossible to implement recursion.

2) Automatic garbage collection is essential to implement recursion.

3) Dynamic allocation of activation records is essential to implement recursion.

4) Both heap and stack are essential to implement recursion.

1) Static allocation of all data areas by a compiler makes it impossible to implement recursion.

2) Automatic garbage collection is essential to implement recursion.

3) Dynamic allocation of activation records is essential to implement recursion.

4) Both heap and stack are essential to implement recursion.

2

GATE CSE 2014 Set 3

MCQ (Single Correct Answer)

+1

-0.3

Let A be a square matrix size $$n \times n$$. Consider the following pseudocode. What is the
expected output?

```
C = 100;
for i = 0 to n do
for j = 1 to n do
{
Temp = A[ i ][ j ] + C ;
A[ i ][ j ] = A[ j ][ i ] ;
A[ j ][ i ] = Temp - C ;
}
for i = 0 to n do
for j = 1 to n do
output(A[ i ][ j ]);
```

3

GATE CSE 2014 Set 2

Numerical

+1

-0

Consider the function func shown below:

The value returned by func(435) is _________.

```
int func(int num)
```

{

int count = 0;

while(num)

{

count++;

num >>= 1;

}

return (count);

}

The value returned by func(435) is _________.

Your input ____

4

GATE CSE 2014 Set 2

MCQ (Single Correct Answer)

+1

-0.3

Suppose n and p are unsigned int variables in a C program. We wish to set p to $${}^n{C_3}$$. If n is
large, which one of the following statements is most likely to set p correctly?

Questions Asked from Basic of Programming Language (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2024 Set 1 (1)
GATE CSE 2021 Set 2 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2014 Set 3 (2)
GATE CSE 2014 Set 2 (3)
GATE CSE 2010 (1)
GATE CSE 2005 (1)
GATE CSE 2004 (2)
GATE CSE 2003 (1)
GATE CSE 2002 (1)
GATE CSE 1997 (1)
GATE CSE 1995 (1)
GATE CSE 1994 (1)
GATE CSE 1991 (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