GATE CSE 2007 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2007

MCQ (Single Correct Answer)

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

$$\left\lceil {{{\log }_2}n} \right\rceil + 1$$

$$\left\lceil {{{\log }_2}n} \right\rceil $$

$$\left\lfloor {{{\log }_2}n} \right\rfloor + 1$$

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

An array of n numbers is given, where n is an even number. The maximum as well as the minimum of these n numbers needs to be determined. Which of the following is TRUE about the number of comparisons needed?

At least 2n – c comparisons, for some constant c, are needed.

At most 1.5n – 2 comparisons are needed.

At least n log₂ n comparisons are needed.

None of the above.

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity by

Dijkstra’s algorithm starting from S.

Warshall’s algorithm

Performing a DFS starting from S.

Performing a BFS starting from S.

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

Suppose the letters a, b, c, d, e, f have probabilities 1/2, 1/4, 1/8, 1/16, 1/32, 1/32 respectively. What is the average length of Huffman codes?

2.1875

2.25

1.9375

GATE CSE Papers

2025