GATE CSE 2009 | GATE CSE Year Wise Previous Years Questions

PREVIOUS NEXT

GATE CSE 2009

MCQ (Single Correct Answer)

-0.6

Consider a binary max-heap implemented using an array. Which one of the following array represents a binary max-heap?

$$\left\{25,12,16,13,10,8,14\right\}$$

$$\left\{25,14,13,16,10,8,12\right\}$$

$$\left\{25,14,16,13,10,8,12\right\}$$

$$\left\{25,14,12,13,10,8,16\right\}$$

GATE CSE 2009

MCQ (Single Correct Answer)

-0.3

What is the number of swaps required to sort n elements using selection sort, in the worst case?

$$\Theta(n)$$

$$\Theta(n \log n)$$

$$\Theta(n^2)$$

$$\Theta(n^2 \log n)$$

GATE CSE 2009

MCQ (Single Correct Answer)

-0.3

Which of the following statement(s) is / are correct regarding Bellman-Ford shortest path algorithm?
P: Always finds a negative weighted cycle, if one exist s.
Q: Finds whether any negative weighted cycle is reachable from the source.

P Only

Q Only

Both P and Q

Neither P nor Q

GATE CSE 2009

MCQ (Single Correct Answer)

-0.6

The running time of an algorithm is represented by the following recurrence relation:
$$T(n) = \begin{cases} n & n \leq 3 \\ T(\frac{n}{3})+cn & \text{ otherwise } \end{cases}$$
Which one of the following represents the time complexity of the algorithm?

$$\Theta(n)$$

$$\Theta(n \log n)$$

$$\Theta(n^2)$$

$$\Theta(n^2 \log n)$$

PREVIOUS NEXT

GATE CSE Papers

2023