What are common examiner traps in Computer Networks?

Unit mismatch: Failing to convert between bytes and bits (multiplying or dividing by 8) for frame size or bandwidth. Metric prefixes: Confusing 1 kbps = 103 bps (networking convention) with 210 bps, or mixing milliseconds (10-3 s) with microseconds (10-6 s) and nanoseconds (10-9 s). One-way vs. Round-Trip Time: Forgetting that total cycle time includes 2 Tp (round-trip propagation) rather than single Tp. Useful vs. Total Transmission Time: Neglecting to subtract header/overhead bytes when computing useful transmission efficiency if distinct overheads are specified. CRC 0-padding: Appending k zeros instead of (k - 1) zeros for a generator pattern of length k bits. Confusing Selective Repeat sequence space (N 2Ws) with Go-Back-N sequence space (N Ws + 1). Failing to ceil the continuous value of window size 1 + 2a to an integer before multiplying by 2 for Selective Repeat sequence space. Unit conversion errors between bits and bytes (e.g., 1 KB = 1024 8 bits or 1000 8 bits) and milliseconds to seconds.

Computer Networks

11 topics · 133 Qs · 7.6 marks/paper · since 2011

Start mock (30 Qs)

Medium Access Control (MAC) in GATE CS is predominantly tested through quantitative numerical problems and conceptual protocol comparisons. GATE CS tests TCP across three primary a… Guide

Topics

Open a topic to browse, or practice it timed.

By year

Jump to the first question from that paper.

Subject guide

What does GATE test in Computer Networks?

Medium Access Control (MAC) in GATE CS is predominantly tested through quantitative numerical problems and conceptual protocol comparisons. 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). IPv4 testing in GATE CS focuses heavily on numerical datagram mechanics (fragmentation offset, payload size, header scaling factors), CIDR subnetting (subnet allocation, host ranges, bitwise masking, and longest prefix match forwarding), and IP header architecture (field modifications during transit, option field capacity, and encapsulated protocol numbers).

Core concepts

Stop-and-Wait Protocol and ARQ efficiency
Sliding Window Protocols (Go-Back-N, Selective Repeat)
Bandwidth-Delay Product (BDP) and Channel Utilization
Sequence Number Field sizing and wrap-around time constraints
Error Detection using Cyclic Redundancy Check (CRC) modulo-2 division
Transmission delay vs. Propagation delay vs. Processing delay trade-offs
Selective Repeat (SR) ARQ Mechanics
Propagation Delay (Tp) vs Transmission Time (Tt)
Link Utilization and Efficiency ( )
Window Sizing (Ws, Wr)
Sequence Number Space Sizing (2k Ws + Wr)
Cyclic Redundancy Check (CRC) mechanism

High-yield formulas

Transmission Time and Propagation Delay

T_t = \frac{L}{B}, \quad T_p = \frac{d}{v}

Used to compute data/ACK packet transmission times and one-way propagation delays from frame length $L$ , bandwidth $B$ , distance $d$ , and signal speed $v$ .

Stop-and-Wait Efficiency (Standard / Ideal)

\eta = \frac{T_t}{T_t + 2T_p} = \frac{1}{1 + 2a}, \quad \text{where } a = \frac{T_p}{T_t}

Used when processing delay and ACK transmission time are negligible.

Stop-and-Wait ARQ Efficiency (Detailed with Overheads)

\eta = \frac{T_{\text{useful}}}{T_t + 2T_p + T_{\text{proc}} + T_{\text{ack}}}

Used when ACK size, node processing time, or header/payload byte separations are explicitly specified.

Sliding Window Optimal Window Size for 100% Utilization

W \ge 1 + 2a = 1 + 2\left(\frac{T_p}{T_t}\right)

Used to find the minimum sender window size $W$ (in frames) needed to achieve full link utilization.

Sequence Number Space and Wrap-around Time

$2^N \ge \text{Bandwidth (bytes/s)} \times T_{\text{wrap-around}}$ and $2^N \ge W_s + W_r$

Used when determining the minimum sequence number bits $N$ under maximum throughput and lifetime/wrap-around constraints.

CRC Modulo-2 Arithmetic

\text{Appended Bits} = (k - 1) \text{ zeros}, \quad \text{Remainder} = (\text{Data} \cdot 2^{k-1}) \pmod_2 G

Used to compute CRC checksum/FCS bits for an error-detecting generator $G$ of length $k$ .

Frame Transmission Time

T_t = \frac{L}{B}

Used to find the time taken to transmit a data frame of size $L$ over a link of bandwidth $B$ .

Normalized Propagation Delay (a-parameter)

a = \frac{T_p}{T_t}

Used to relate one-way propagation delay $T_p$ to packet transmission delay $T_t$ .

Examiner traps in Computer Networks

Unit mismatch: Failing to convert between bytes and bits (multiplying or dividing by 8) for frame size or bandwidth.
Metric prefixes: Confusing 1 kbps = 103 bps (networking convention) with 210 bps, or mixing milliseconds (10-3 s) with microseconds (10-6 s) and nanoseconds (10-9 s).
One-way vs. Round-Trip Time: Forgetting that total cycle time includes 2 Tp (round-trip propagation) rather than single Tp.
Useful vs. Total Transmission Time: Neglecting to subtract header/overhead bytes when computing useful transmission efficiency if distinct overheads are specified.
CRC 0-padding: Appending k zeros instead of (k - 1) zeros for a generator pattern of length k bits.
Confusing Selective Repeat sequence space (N 2Ws) with Go-Back-N sequence space (N Ws + 1).
Failing to ceil the continuous value of window size 1 + 2a to an integer before multiplying by 2 for Selective Repeat sequence space.
Unit conversion errors between bits and bytes (e.g., 1 KB = 1024 8 bits or 1000 8 bits) and milliseconds to seconds.

How questions show up

Stop-and-Wait Protocol Efficiency and Parameter Sizing
common · mixed · 2 marks · 2025, 2017, 2015
Calculations involving link utilization $\eta = \frac{T_t}{T_{\text{total}}}$ , determining minimum frame size for target utilization, or finding efficiency with detailed parameters including ACK transmission time, processing overheads, and packet headers.
Sliding Window Sizing and Sequence Number Constraints
common · mixed · 2 marks · 2026
Calculating optimal sender window size $W = 1 + 2a$ for 100% link utilization, or determining the sequence number bit width $N$ under dual constraints of maximum link utilization and sequence number wrap-around time.
Cyclic Redundancy Check (CRC) Modulo-2 Division
occasional · MCQ · 2 marks · 2026
Given a data bit sequence and a generator polynomial bit pattern of length $k$ , finding the $(k-1)$ -bit CRC remainder appended to the frame by performing XOR-based modulo-2 division.
Qualitative Analysis of Protocol Utilization
occasional · MCQ · 1 marks · 2023
Identifying the relationship between protocol efficiency $\eta = \frac{1}{1 + 2a}$ and physical parameters like link distance, bandwidth, frame size, and propagation velocity.
Sequence Number Field Sizing for Sliding Window Protocols
occasional · NAT · 2 marks · 2016
Given channel bandwidth, one-way propagation delay, frame length, and protocol type (e.g., Selective Repeat), compute the frame transmission time, required sender window size for target link utilization (often 100%), total sequence number space size ( $W_s + W_r$ ), and the minimum number of sequence number bits required.
CRC Remainder / Checkbit Calculation
common · MCQ · 2 marks · 2021
Given a generator polynomial $G(X)$ of degree $r$ and a binary data word / message $M$ , calculate the $r$ -bit CRC code (remainder) generated by modulo-2 polynomial division of $(M \cdot 2^r)$ by $G(X)$ .