GATE CSE 2007 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

The distance between two stations M and N is L kilometers. All frames are K bits long. The propagation delay per kilometer is t seconds. Let R bits/second be the channel capacity. Assuming that processing delay is negligible, the minimum number of bits for the sequence number field in a frame for maximum utilization, when the sliding window protocol is used, is:

$$\left\lceil {{{\log }_2}{{2LtR + 2K} \over K}} \right\rceil $$

$$\left\lceil {{{\log }_2}{{2LtR} \over K}} \right\rceil $$

$$\left\lceil {{{\log }_2}{{2LtR + K} \over K}} \right\rceil $$

$$\left\lceil {{{\log }_2}{{2LtR + 2K} \over {2K}}} \right\rceil $$

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

The message 11001001 is to be transmitted using the CRC polynomial x³ + 1 to protect it from errors. The message that should be transmitted is:

11001001000

11001001011

11001010

110010010011

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

There are n stations in a slotted LAN. Each station attempts to transmit with a probability p in each time slot. What is the probability that ONLY one station transmits in a given time slot?

np(1 - p)^{n - 1}

(1 - p)^{n - 1}

p(1 - p)^{n - 1}

1 - (1 - p)^{n - 1}

GATE CSE 2007

MCQ (Single Correct Answer)

-0.3

In Ethernet when Manchester encoding is used, the bit rate is:

Half the baud rate.

Twice the baud rate.

Same as the baud rate.

None of the above

PREVIOUS NEXT

GATE CSE Papers

2024