GATE CS 2026 (Forenoon) — Question 45

Computer Networks (CN)Data Link Layer (Framing, Error Detection, MAC, Ethernet Bridging)MCQ2 marks · −2/3 if wrongMedium

Consider the implementation of sliding window protocol over a lossless link, with a window size of \( W \) frames, where each frame is of size 1000 bits (including header). The bandwidth of the link is 100 kbps (1k = \( 10^3 \)) and the one-way propagation delay is 100 milliseconds. Assume that processing times at the sender and receiver are zero and the transmission time of acknowledgements is also zero. Which one of the following options gives the minimum size of \( W \) (in number of frames) required to achieve 100% link utilization?
  1. A
    10
  2. B
    21
  3. C
    20
  4. D
    11
Practise the full 2026-FN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkComputer Networks (Tanenbaum)Layers, routing, TCP/IP and error control, explained clearly.
Practise more on Data Link Layer (Framing, Error Detection, MAC, Ethernet Bridging)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group