1

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}is2

GATE CSE 2016 Set 2

Numerical

+2

-0

The given diagram shows the flowchart for a recursive function $$A(n).$$ Assume that all statements, except for the recursive calls, have $$O(1)$$ time complexity. If the worst case time complexity of this function is $$O\left( {{n^\alpha }} \right),$$ then the least possible value (accurate up to two decimal positions) of $$\alpha $$ is ____________ .

Your input ____

3

GATE CSE 2015 Set 1

MCQ (Single Correct Answer)

+2

-0.6

An algorithm performs $${\left( {\log N} \right)^{1/2}}$$ find operations, N insert operations, $${\left( {\log N} \right)^{1/2}}$$ delete operations, and $${\left( {\log N} \right)^{1/2}}$$decrease-key operations on a set of data items with keys drawn from a linearly ordered set. For a delete operation, a pointer is provided to the record that must be deleted. For the decrease-key operation, a pointer is provided to the record that has its key decreased. Which one of the following data structures is the most suited for the algorithm to use, if the goal is to achieve the best total asymptotic complexity considering all the operations?

4

GATE CSE 2015 Set 1

MCQ (Single Correct Answer)

+2

-0.6

Consider the following C function.

```
int fun1 (int n) {
int i, j, k, p, q = 0;
for (i = 1; i < n; ++i)
{
p = 0;
for (j = n; j > 1; j = j/2)
++p;
for (k = 1; k < p; k = k * 2)
++q;
}
return q;
}
```

Which one of the following most closely approximates the return value of the function **fun1**?Questions 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 1 (2)
GATE CSE 2015 Set 3 (1)
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