GateAI
Switching and Performance Metrics

GATE CSE 2024 Set 1 · Q36

MCQ2 marksMedium

Time

Consider a network path P—Q—R\text{P—Q—R} between nodes P\text{P} and R\text{R} via router Q\text{Q}. Node P\text{P} sends a file of size 10610^6 bytes to R\text{R} via this path by splitting the file into chunks of 10310^3 bytes each. Node P\text{P} sends these chunks one after the other without any wait time between the successive chunk transmissions. Assume that the size of extra headers added to these chunks is negligible, and that the chunk size is less than the MTU. Each of the links P—Q\text{P—Q} and Q—R\text{Q—R} has a bandwidth of 10610^6 bits/sec, and negligible propagation latency. Router Q\text{Q} immediately transmits every packet it receives from P\text{P} to R\text{R}, with negligible processing and queueing delays. Router Q\text{Q} can simultaneously receive on link P—Q\text{P—Q} and transmit on link Q—R\text{Q—R}. Assume P\text{P} starts transmitting the chunks at time t=0t = 0. Which one of the following options gives the time (in seconds\textit{in seconds}, rounded off to 3 decimal places) at which R\text{R} receives all the chunks of the file?

Select one answerSingle correct

Pick an option to check

Solution

Step-by-step verified solution

Official answer: B) 8.008

Switching and Performance Metrics

To find the total time taken for node R\text{R} to receive all chunks of the file:

  1. Parameters given:

    • Total file size: F=106 bytesF = 10^6\text{ bytes}

    • Chunk size (packet size): L=103 bytes=103×8 bits=8000 bitsL = 10^3\text{ bytes} = 10^3 \times 8\text{ bits} = 8000\text{ bits}

    • Total number of chunks: N=106103=1000 chunksN = \frac{10^6}{10^3} = 1000\text{ chunks}

    • Bandwidth of each link: B=106 bits/secB = 10^6\text{ bits/sec}

    • Number of links (hops): k=2k = 2

    • Propagation, processing, and queuing delays are negligible.

  2. Transmission time for a single chunk over one link:

    Tt=LB=8000 bits106 bits/sec=0.008 secondsT_t = \frac{L}{B} = \frac{8000\text{ bits}}{10^6\text{ bits/sec}} = 0.008\text{ seconds}
  3. Pipelined transmission across 2 hops:

    • Node P\text{P} finishes transmitting all 10001000 chunks over link P—Q\text{P—Q} at time:

      t1=N×Tt=1000×0.008 s=8.000 secondst_1 = N \times T_t = 1000 \times 0.008\text{ s} = 8.000\text{ seconds}
    • At t=8.000 st = 8.000\text{ s}, router Q\text{Q} receives the final (1000th1000^{\text{th}}) chunk completely.

    • Router Q\text{Q} then transmits this final chunk over link Q—R\text{Q—R}, which takes one additional transmission delay of 0.008 seconds0.008\text{ seconds}.

  4. Total time to receive all chunks at R\text{R}:

    Total Time=(N+k−1)×Tt=(1000+2−1)×0.008 s=1001×0.008 s=8.008 seconds\text{Total Time} = (N + k - 1) \times T_t = (1000 + 2 - 1) \times 0.008\text{ s} = 1001 \times 0.008\text{ s} = 8.008\text{ seconds}

Thus, the correct option is (B).

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 Switching and Performance Metrics previous year question is Q36 of the GATE CSE 2024 Set 1 paper. Find more GATE CSE PYQs on Switching and Performance Metrics 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 Switching and Performance Metrics 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.

Switching and Performance Metrics in GATE CSE

Switching and Performance Metrics has 11 GATE CSE PYQs across 9 papers from 2013 to 2026. 3 of them are 2-mark MCQs like this one, and it is the only one in GATE CSE 2024 Set 1.

How GATE tests Switching and Performance Metrics

More from GATE CSE 2024 Set 1

Share this solution

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

GateAI solution cardGATE CSE 2024 Set 1 · Q36 · MCQ

Consider a network path P—Q—R between nodes P and R via router Q. Node P sends a file of size 106 bytes to R via this path by splitting the file into chunks of 103 bytes each. Node P sends these chunks one after the other without any wait time between the successive chunk transmissions. Assume that the size of extra headers added to these chunks is negligible, and that the chunk size is less than the MTU. Each of the links P—Q and Q—R has a bandwidth of 106 bits/sec, and negligible propagation latency. Router Q immediately transmits every packet it receives from P to R, with negligible processing and queueing delays. Router Q can simultaneously receive on link P—Q and transmit on link Q—R. Assume P starts transmitting the chunks at time t = 0. Which one of the following options gives the time ( in seconds, rounded off to 3 decimal places) at which R receives all the chunks of the file?

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.