Computer Networks · TCP Flow and Congestion Control
Official IIT answer key · IIT Kanpur · Audited Aug 2026
GATE CSE 2015 Set 3 Q22 · MCQ · 1 mark
Key concept
No account needed
Sit 5 related TCP Flow and Congestion ControlPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
GATE CS tests TCP across three primary areas: congestion control dynamics (window growth phases, timeout recovery, and round-by-round segment tracking), sequence number wrap-around time and bit-budget calculations against MSL, and connection lifecycle mechanics (3-way handshake flags, state transitions during active/passive close, and crash recovery with RST segments). Questions are balanced between computational NATs involving RTTs and discrete bit math, and conceptual MSQ/MCQs focusing on byte-stream mechanics, piggybacking, and RFC 793 protocol invariants.
Full TCP Flow and Congestion Control guide →Consider the following statements. I. TCP connections are full duplex II. TCP has no option for selective acknowledgement III. TCP connections are message streams (A) Only I is correct (B) Only I and III are correct (C) Only II and III are correct (D) All of I, II and III are correct
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.
