1

GATE CSE 2023

MCQ (More than One Correct Answer)

+2

-0.67

Consider functions Function_1 and Function_2 expressed in pseudocode as follows:

```
Function 1
while n > 1 do
for i = 1 to n do
x = x + 1;
end for
n = n/2;
end while
```

```
Function 2
for i = 1 to 100 ∗ n do
x = x + 1;
end for
```

Let $$f_1(n)$$ and $$f_2(n)$$ denote the number of times the statement "$$x=x+1$$" is executed in Function_1 and Function_2, respectively.

Which of the following statements is/are TRUE?

2

GATE CSE 2021 Set 1

MCQ (Single Correct Answer)

+2

-0.67

Consider the following three functions.

f_{1} = 10^{n}, f_{2} = n^{logn}, f_{3} = n^{√n}

Which one of the following options arranges the functions in the increasing order of asymptotic growth rate?

3

GATE CSE 2021 Set 1

MCQ (Single Correct Answer)

+2

-0.67

Consider the following recurrence relation.

$$T(n) = \left\{ {\begin{array}{*{20}{c}} {T(n/2) + T(2n/5) + 7n \ \ \ if\ n > 0}\\ {1\ \ \ \ \ \ \ if\ n = 0} \end{array}} \right.$$

Which one of the following option is correct?

4

GATE CSE 2019

MCQ (Single Correct Answer)

+2

-0.67

There are n unsorted arrays: A

_{1}, A_{2}, ..., A_{n}. Assume that n is odd. Each of A_{1}, A_{2}, ..., A_{n}contains n distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of A_{1}, A_{2}, ..., A_{n}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