GateAI
TCP Flow and Congestion Control

GATE CSE 2015 Set 1 · Q19

MCQ1 markMedium

Time

Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection? I. If the sequence number of a segment is mm, then the sequence number of the subsequent segment is always m+1m+1. II. If the estimated round trip time at any given point of time is tt sec, the value of the retransmission timeout is always set to greater than or equal to tt sec. III. The size of the advertised window never changes during the course of the TCP connection. IV. The number of unacknowledged bytes at the sender is always less than or equal to the advertised window.

Select one answerSingle correct

Pick an option to check

Solution

Step-by-step verified solution

Official answer: B) I and III only

TCP Flow and Congestion Control

Let us evaluate each statement:

  • Statement I is FALSE: TCP uses byte-stream sequence numbering rather than segment numbering. If a segment starts with sequence number mm and contains LL bytes of payload data, the sequence number of the next segment will be m+Lm + L, which is generally not m+1m + 1 (except when the segment carries only 11 byte).

  • Statement II is TRUE: The Retransmission Timeout (RTO) is calculated as RTO=SRTT+4×RTTVAR\text{RTO} = \text{SRTT} + 4 \times \text{RTTVAR} (or similar formulas based on Jacobson's algorithm), which ensures RTO≥RTT\text{RTO} \ge \text{RTT} so that packets are not prematurely retransmitted before an acknowledgement can reasonably arrive.

  • Statement III is FALSE: TCP uses a dynamic sliding window for flow control. The receiver continuously advertises its available buffer space (the Advertised Window or Receiver Window, rwnd), which dynamically changes depending on how fast the receiving application reads data from the buffer.

  • Statement IV is TRUE: Flow control guarantees that the sender cannot have more unacknowledged in-flight bytes than the receiver's currently advertised window size.

Therefore, statements I and III are FALSE, making (B) the correct choice.

Try the question first, then check your work.

Think the official key or this write-up is wrong?

Report error or challenge

Examiner trap

The misconception this question tests

This TCP Flow and Congestion Control previous year question is Q19 of the GATE CSE 2015 Set 1 paper. Find more GATE CSE PYQs on TCP Flow and Congestion Control in Computer Networks, or browse all GATE CSE PYQs.

Free diagnostic

Where do you stand for GATE?

Take the 20-minute diagnostic: the 3 topics that cost you the most marks, and a rank range. Or sit 5 related TCP Flow and Congestion Control PYQs now with no account.

One GATE CSE PYQ every morning

An official question by email at 7 AM IST, with a link to its verified solution. Unsubscribe in one click.

TCP Flow and Congestion Control in GATE CSE

TCP Flow and Congestion Control has 23 GATE CSE PYQs across 21 papers from 2012 to 2026. 10 of them are 1-mark MCQs like this one, and it is the only one in GATE CSE 2015 Set 1.

How GATE tests TCP Flow and Congestion Control

More from GATE CSE 2015 Set 1

Share this solution

A plain-text card for WhatsApp or Telegram study groups.

GateAI solution cardGATE CSE 2015 Set 1 · Q19 · MCQ

Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection? I. If the sequence number of a segment is m, then the sequence number of the subsequent segment is always m+1. II. If the estimated round trip time at any given point of time is t sec, the value of the retransmission timeout is always set to greater than or equal to t sec. III. The size of the advertised window never changes during the course of the TCP connection. IV. The number of unacknowledged bytes at the sender is always less than or equal to the advertised window.

Topic-wise GATE CS PYQs with verified steps

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.