GATE CSE 2008 | GATE CSE Year Wise Previous Years Questions

GATE CSE

PREVIOUS NEXT

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

An LALR(1) parser for a grammar G can have shift-reduce (S-R) conflicts if and only if

The SLR(1) parser for G has S - R conflicts

The LR(1) parser for G has S - R conflicts

The LR(0) parser for G has S - R conflicts

The LALR(1) parser for G has reduce-reduce conflicts

GATE CSE 2008

MCQ (Single Correct Answer)

-0.3

Some code optimizations are carried out on the intermediate code because

They enhance the portability of the compiler to other target processors

Program analysis is more accurate on intermediate code than on machine code

The information from dataflow analysis cannot otherwise be used for optimization

The information from the front end cannot otherwise be used for optimization

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

The total number of keys required for a set of n individuals to be able to communicate with each other using secret key and public key crypto-systems, respectively are:

n(n - 1) and 2n

2n and $${{N(N - 1)} \over 2}$$

$${{N(N - 1)} \over 2}$$ and 2n

$${{N(N - 1)} \over 2}$$ and n

GATE CSE 2008

MCQ (Single Correct Answer)

-0.6

A computer on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. It is initially filled to capacity with 16 Megabits. What is the maximum duration for which the computer can transmit at the full 10 Mbps?

1.6 seconds

2 seconds

5 seconds

8 seconds

PREVIOUS NEXT

GATE CSE Papers

2025