1

GATE CSE 2012

MCQ (Single Correct Answer)

+1

-0.3

Let W(n) and A(n) denote respectively, the worst case and average case running time of an algorithm executed on an input of size n. Which of the following is ALWAYS TRUE?

2

GATE CSE 2010

MCQ (Single Correct Answer)

+1

-0.3

Two alternate packages A and B are available for processing a database having 10

^{k}records. Package A requires 0.0001n^{2}time units and package B requires $$10n.\log _{10}^n$$ time units to process n records. What is the smallest value of k for which package B will be preferred over A?3

GATE CSE 2007

MCQ (Single Correct Answer)

+1

-0.3

Consider the following segment of C-code:

```
int j, n;
j=1;
while(j <= n)
j = j * 2;
```

The number of comparisons made in the execution of the loop for any n > 0 is:4

GATE CSE 2006

MCQ (Single Correct Answer)

+1

-0.3

Consider the following C-program fragment in which i, j and n are integer variables.

for (i = n, j = 0; i > 0; i /= 2, j += i);

let val (j) denote the value stored in the variable j after termination of the for loop. Which one of the following is true?

for (i = n, j = 0; i > 0; i /= 2, j += i);

let val (j) denote the value stored in the variable j after termination of the for loop. Which one of the following is true?

Questions Asked from Complexity Analysis and Asymptotic Notations (Marks 1)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2023 (1)
GATE CSE 2022 (1)
GATE CSE 2020 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2013 (3)
GATE CSE 2012 (2)
GATE CSE 2010 (1)
GATE CSE 2007 (1)
GATE CSE 2006 (1)
GATE CSE 2005 (1)
GATE CSE 2003 (2)
GATE CSE 2002 (1)
GATE CSE 2001 (1)
GATE CSE 1999 (1)
GATE CSE 1997 (1)
GATE CSE 1996 (1)

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