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

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.6

Suppose a polynomial time algorithm is discovered that correctly computes the largest clique in a given graph. In this scenario, which one of the following represents the correct Venn diagram of the complexity classes P, NP and NP Complete (NPC)?

GATE CSE 2014 Set 1 Algorithms - P and NP Concepts Question 3 English Option 1

GATE CSE 2014 Set 1 Algorithms - P and NP Concepts Question 3 English Option 2

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.6

A canonical set of items is given below

$$\eqalign{ & S \to L. > R \cr & Q \to R. \cr} $$

On input symbol < the set has

a shift-reduce conflict and a reduce-reduce conflict.

a shift-reduce conflict but not a reduce-reduce conflict.

a reduce-reduce conflict but not a shift-reduce conflict.

neither a shift-reduce nor a reduce-reduce conflict.

GATE CSE 2014 Set 1

MCQ (Single Correct Answer)

-0.3

Which one of the following is FALSE?

A basic block is a sequence of instructions where control enters the sequence at the beginning and exits at the end.

Available expression analysis can be used for common subexpression elimination.

Live variable analysis can be used for dead code elimination

$$x = 4*5 \Rightarrow x = 20$$ is an example of common subexpression elimination

GATE CSE 2014 Set 1

Numerical

-0

Consider a selective repeat sliding window protocol that uses a frame size of 1 KB to send data on a 1.5 Mbps link with a one-way latency of 50 msec. To achieve a link utilization of 60%, the minimum number of bits required to represent the sequence number field is ________.

Your input ____

PREVIOUS NEXT

GATE CSE Papers

2023