CS Atlas GATE 2027
Computer Networks course
0 / 90 complete

Computer Networks/Phase 1 · Layering, Switching & Performance

Checkpoint CP1 · Item 23 of 90

Layering, switching and performance

Read at your own pace. Try the questions before opening the answers.

On this page

Introduction

Fifteen GATE-style questions on Phase 1. Delay numericals carry most of the marks — write units on every line.

Practice questions

  1. MCQ · 1 mark

    Process-to-process delivery is handled by:

    1. data link layer
    2. network layer
    3. transport layer
    4. session layer
  2. MSQ · 1 mark

    Which statements about encapsulation are correct?

    1. The data link layer adds a header and a trailer.
    2. The transport PDU is called a segment.
    3. A router reads the transport header to forward.
    4. Network-layer addresses stay the same end to end.
  3. NAT · 1 mark

    A 700-byte message gets headers of 20, 20 and 14 bytes and a 4-byte trailer. Fraction of the frame that is message data (3 decimals)?

    Write your answer before opening the key.

  4. MCQ · 1 mark

    Which device works only at the physical layer?

    1. Switch
    2. Repeater
    3. Router
    4. Bridge
  5. MSQ · 1 mark

    Which are true of virtual-circuit switching?

    1. It has a setup phase.
    2. Bandwidth is reserved.
    3. Packets follow one path.
    4. Packets carry short labels.
  6. NAT · 2 marks

    A 1.544 Mbps link carries 24 circuits. Time (s) to send 3,860,000 bits on one circuit after 0.5 s setup?

    Write your answer before opening the key.

  7. NAT · 1 mark

    Transmission delay (µs) of a 1500-byte packet on a 1 Gbps link?

    Write your answer before opening the key.

  8. NAT · 2 marks

    8 packets of 1000 bytes over 3 links of 2 Mbps, Tp = 3 ms per link, store-and-forward. Total in ms?

    Write your answer before opening the key.

  9. NAT · 2 marks

    4 packets of 2000 bits over links of 4 Mbps then 1 Mbps (Tp = 0). Arrival of the last packet in ms?

    Write your answer before opening the key.

  10. MCQ · 1 mark

    Propagation delay depends on:

    1. packet size
    2. bit rate
    3. distance and signal speed
    4. number of packets
  11. NAT · 2 marks

    B = 1 Mbps, Tp = 250 ms, units 10,000 bits, send-and-wait. Utilisation (3 decimals)?

    Write your answer before opening the key.

  12. NAT · 1 mark

    Bandwidth-delay product in bits: B = 50 Mbps, Tp = 8 ms.

    Write your answer before opening the key.

  13. MCQ · 2 marks

    Which is the minimum unit size for 50 % send-and-wait utilisation on B = 8 Mbps, Tp = 5 ms?

    1. 10,000 bytes
    2. 5,000 bytes
    3. 80,000 bytes
    4. 40,000 bytes
  14. NAT · 2 marks

    M = 6 × 10⁴ bits, packets of 1000 data + 20 header bits, 4 links of 1 Mbps, Tp = 0. Total in ms (3 decimals)?

    Write your answer before opening the key.

  15. MCQ · 1 mark

    With a fixed header per packet, the delay-minimising packet size on a multi-hop path is roughly:

    1. as large as possible
    2. as small as possible
    3. √(M·H/(h − 1))
    4. M / h

Answer key

Try the questions first. Open when you are ready to check.
  1. C — Transport = process to process.
    • A: Hop to hop.
    • B: Host to host.
    • D: Dialogue control.

    Review lesson 1.1.2

  2. ABD — Frames have trailers; segment = transport PDU; network addresses are end to end.
    • C: Routers forward using the network header only.

    Review lesson 1.1.3

  3. 0.923..0.924 — 700 / 758 = 0.9235.

    Review lesson 1.1.3

  4. B — A repeater regenerates bits.
    • A: Layer 2.
    • C: Layer 3.
    • D: Layer 2.

    Review lesson 1.1.3

  5. ACD — Setup, fixed path, short labels, no bandwidth reservation.
    • B: Only circuit switching reserves bandwidth.

    Review lesson 1.2.3

  6. 60.5 — Circuit rate 64,333.3 bit/s → 60 s; + 0.5 s = 60.5 s.

    Review lesson 1.2.1

  7. 12 — 12,000 / 10⁹ s = 12 µs.

    Review lesson 1.3.1

  8. 49 — Tt = 4 ms; (8 + 2) × 4 + 9 = 49 ms.

    Review lesson 1.3.2

  9. 8.5 — First: 0.5 + 2 = 2.5 ms; then 3 more × 2 ms (bottleneck) = 8.5 ms.

    Review lesson 1.3.2

  10. C — Tp = d / v.
    • A: That affects Tt.
    • B: That affects Tt.
    • D: Irrelevant to Tp.

    Review lesson 1.3.2

  11. 0.019..0.020 — Tt = 10 ms; U = 10/510 = 0.0196.

    Review lesson 1.3.3

  12. 400000 — 5 × 10⁷ × 0.008 = 4 × 10⁵.

    Review lesson 1.3.3

  13. A — L ≥ 2·B·Tp = 80,000 bits = 10,000 bytes.
    • B: Uses Tp instead of 2Tp.
    • C: Left in bits but labelled bytes.
    • D: Uses B·Tp in bits.

    Review lesson 1.3.3

  14. 64.26 — (60 + 3) × 1.02 = 64.26 ms.

    Review lesson 1.3.4

  15. C — Balance of pipelining against header overhead.
    • A: Large packets lose pipelining.
    • B: Tiny packets drown in headers.
    • D: Not the optimum.

    Review lesson 1.3.4

Ready for the next idea?

Mark this item complete when you’ve finished reading and working through it.