GATE CSE 2006 | GATE CSE Year Wise Previous Years Questions

GATE CSE

GATE CSE 2006

MCQ (Single Correct Answer)

-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?

val (j) = $$\theta $$ (log n)

val (j) = ($$\sqrt n $$)

val (j) = $$\theta $$ (n)

val (j) = $$\theta $$ (n log n)

GATE CSE 2006

MCQ (Single Correct Answer)

-0.3

In a binary max heap containing n numbers, the smallest element can be found in time

$$O(n)$$

$$O(\log n)$$

$$O(\log \log n)$$

$$O(1)$$

GATE CSE 2006

MCQ (Single Correct Answer)

-0.3

Which one of the following in place sorting algorithms needs the minimum number of swaps?

Quick sort

Insertion sort

Selection sort

Heap sort

GATE CSE 2006

MCQ (Single Correct Answer)

-0.3

An element in an array X is called a leader if it is greater than all elements to the right of it in X. The best algorithm to find all leaders in an array

Solves it in linear time using a left to right pass of the array

Solves it in linear time using a right to left pass of the array

Solves it using divide and conquer in time $$\theta \left( {n\log n} \right)$$

Solves it in time $$\theta \left( {{n^2}} \right)$$

GATE CSE Papers

2023