GATE CSE 2000 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2000

MCQ (Single Correct Answer)

-0.3

Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than 1000 in s. which of the following statements is true?

t (n) is O(1)

n < t (n) < $$n\log _2^n$$

$$n\log _2^n$$ < t (n) < $$\left( {\matrix{ n \cr 2 \cr } } \right)$$

t(n) = $$\left( {\matrix{ n \cr 2 \cr } } \right)$$

GATE CSE 2000

MCQ (Single Correct Answer)

-0.6

Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false?

Every minimum spanning tree of G must contain emin

If emax is in a minimum spanning tree, then its removal must disconnect G

No minimum spanning tree contains emax

G has a unique minimum spanning tree

GATE CSE 2000

MCQ (Single Correct Answer)

-0.3

The number of tokens in the following C statement is:

printf("i = %d, &i = %x",i, &i);

GATE CSE 2000

MCQ (Single Correct Answer)

-0.3

Comparing the time $$T1$$ taken for a single instruction on a pipelined $$CPU$$ with time $$T2$$ taken on a non-pipelined but identical $$CPU,$$ we can say that

$$T1 \le T2$$

$$T1 \ge T2$$

$$T1 < T2$$

$$T1$$ is $$T2$$ plus the time taken for one instruction fetch cycle

PREVIOUS NEXT

GATE CSE Papers

2024