GATE CSE 2014 Set 3 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2014 Set 3

MCQ (Single Correct Answer)

-0.6

Let $$\delta $$ denote the minimum degree of a vertex in a graph. For all planar graphs on $$n$$ vertices with $$\delta \ge 3$$, which one of the following is TRUE?

In any planar embedding, the number of faces is at least $${n \over 2} + 2$$

In any planar embedding, the number of faces is less than $${n \over 2} + 2$$

There is a planar embedding in which the number of facess is less than $${n \over 2} + 2$$

There is a planar embedding in which the number of faces is at most $${n \over {\delta + 1}}$$

GATE CSE 2014 Set 3

MCQ (Single Correct Answer)

-0.3

Which one of the following statements is TRUE about every $$n\,\, \times \,n$$ matrix with only real eigen values?

If the trace of the matrix is positive and the determinant of the negative, at least one of its eigen values is negative.

If the trace of the matrix is positive, all its eigen values are positive.

If the determinanant of the matrix is positive, all its eigen values are positive.

If the product of the trace and determination of the matrix is positive, all its eigen values are positive.

GATE CSE 2014 Set 3

MCQ (Single Correct Answer)

-0.3

Consider the following statements:
P: Good mobile phones are not cheap
Q: Cheap mobile phones are not good
L: P implies Q
M: Q implies P
N: P is equivalent to Q

Which of the following about L, M, and N is Correct?

Only L is TRUE.

Only M is TRUE.

Only N is TRUE.

L, M and N are TRUE.

GATE CSE 2014 Set 3

Numerical

-0

Consider a paging hardware with a TLB. Assume that the entire page table and all the pages are in the physical memory. It takes 10 milliseconds to search the TLB and 80 milliseconds to access the physical memory. If the TLB hit ratio is 0.6, the effective memory access time (in milliseconds) is______________.

Your input ____

PREVIOUS NEXT

GATE CSE Papers

All year-wise previous year question papers

2026