chapter
    Computer Networks PYQs for GATE CS

    GATE CS Computer Networks: 1 units and 6 chapters, weightage from 53 previous year questions across 10 papers, a study order by exam weight and 0 practice que

    A question from this chapter

    Question 1
    2026 Slot Set2 PYQ

    Consider the transmission of data bits over a link that uses Cyclic Redundancy Check (CRC) code for error detection. If the generator bit pattern is given to be , which one of the following options shows the remainder bit pattern appended to the data bits before transmission?

    Question 2
    2026 Slot Set2 PYQ

    If an IP network uses a subnet mask of 255.255.240.0, the maximum number of IP addresses that can be assigned to network interfaces is __________. <i>(answer in integer)</i>

    Question 3
    2025 Slot Set2 PYQ
    Consider the routing protocols given in List I and the names given in List II:

    List I　　　　　　　　　　　　　　　List II
    (i) Distance vector routing　　　　　(a) Bellman-Ford
    (ii) Link state routing　　　　　　　(b) Dijkstra

    For matching of items in List I with those in List II, which ONE of the following options is CORRECT?
    Question 4
    2026 Slot Set2 PYQ
    Consider a new TCP connection between a sender and a receiver. The receiver advertised window is constant at 48 KB, the maximum segment size (MSS) is 2 KB, and the slow start threshold for TCP congestion control is 16 KB. Assume that there are no timeouts or duplicate acknowledgements. The number of rounds of transmission required for the congestion control algorithm of the TCP connection to reach the congestion avoidance phase is ___________. (answer in integer)

    Note:
    Question 5
    2026 Slot Set2 PYQ

    Which one of the following protocols may need to broadcast some of its messages?

    Question 6
    2026 Slot Set2 PYQ
    Consider a file of size 4 million bytes being transferred between two hosts connected via a path consisting of three consecutive links of bandwidth 2 Mbps, 500 kbps, and 1 Mbps, respectively. All processing delays and propagation delays are negligible. Assume that there is no other background traffic over the path and no other additional overhead to transfer the file.
    Which one of the following is the total time (in seconds) to transfer the file?
    Note: ,
    Free preview ends here

    Login to view the complete previous-year questions and solutions

    Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.

    Login to continueSee plans
    Why MastersUp

    Personalised first. High quality throughout.

    Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.

    Built around you, not around a syllabus PDF

    Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.

    Revision that hits your weak spots

    We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.

    Questions calibrated to the real exam

    Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.

    Notes written for recall, not for volume

    Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.

    One place for everything

    Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.

    Honest progress

    No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.

    Unlock the whole course

    Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.

    View all plansStart free

    Computer Networks PYQs for GATE CS

    GATE CS Computer Networks: 1 units and 6 chapters, weightage from 53 previous year questions across 10 papers, a study order by exam weight and 0 practice questions.

    About Computer Networks Previous Year Questions (PYQs)

    53 previous year questions from Computer Networks in GATE CS, grouped by chapter with the exam year, answer key and step-by-step solution for each.

    GATE CS Computer Networks Unit-wise Weightage from Past Papers

    We counted every GATE CS Computer Networks previous year question in our bank (53 questions from 10 papers) and grouped them by unit.

    UnitChaptersPYQsShare of sectionAvg per paper
    Computer Networks653100%5.3

    Suggested Computer Networks Study Order for GATE CS

    1. Computer Networks: 100% of past Computer Networks questions, about 5.3 per paper.

    Start where the marks are. Units at the top of this list have appeared most often in past GATE CS papers.

    Units in GATE CS Computer Networks

    All Computer Networks chapters

    One Solved Question from Each Computer Networks Chapter

    Question 1 · Network Models, Data Link Control, Error Detection and Multiple Access · 2026_Set2 MCQ

    Consider the transmission of data bits over a link that uses Cyclic Redundancy Check (CRC) code for error detection. If the generator bit pattern is given to be , which one of the following options shows the remainder bit pattern appended to the data bits before transmission?

    1. A.

      11

    2. B.

      101

    3. C.

      0

    4. D.

      100

    Question 2 · IPv4 Addressing, Subnetting, NAT and Fragmentation · 2026_Set2 NAT

    If an IP network uses a subnet mask of 255.255.240.0, the maximum number of IP addresses that can be assigned to network interfaces is __________. <i>(answer in integer)</i>

    Question 3 · Routing Protocols and Packet Forwarding · 2025_Set2 MCQ
    Consider the routing protocols given in List I and the names given in List II:

    List I　　　　　　　　　　　　　　　List II
    (i) Distance vector routing　　　　　(a) Bellman-Ford
    (ii) Link state routing　　　　　　　(b) Dijkstra

    For matching of items in List I with those in List II, which ONE of the following options is CORRECT?
    1. A.

      (i) – (a) and (ii) – (b)

    2. B.

      (i) – (a) and (ii) – (a)

    3. C.

      (i) – (b) and (ii) – (a)

    4. D.

      (i) – (b) and (ii) – (b)

    Question 4 · TCP Connection Management, Reliability and Congestion Control · 2026_Set2 NAT
    Consider a new TCP connection between a sender and a receiver. The receiver advertised window is constant at 48 KB, the maximum segment size (MSS) is 2 KB, and the slow start threshold for TCP congestion control is 16 KB. Assume that there are no timeouts or duplicate acknowledgements. The number of rounds of transmission required for the congestion control algorithm of the TCP connection to reach the congestion avoidance phase is ___________. (answer in integer)

    Note:
    Question 5 · Application Layer Protocols and Web Communication · 2026_Set2 MCQ

    Which one of the following protocols may need to broadcast some of its messages?

    1. A.

      SMTP

    2. B.

      FTP

    3. C.

      DHCP

    4. D.

      HTTP

    Question 6 · Network Delay, Throughput and End-to-End Performance · 2026_Set2 MCQ
    Consider a file of size 4 million bytes being transferred between two hosts connected via a path consisting of three consecutive links of bandwidth 2 Mbps, 500 kbps, and 1 Mbps, respectively. All processing delays and propagation delays are negligible. Assume that there is no other background traffic over the path and no other additional overhead to transfer the file.
    Which one of the following is the total time (in seconds) to transfer the file?
    Note: ,
    1. A.

      731

    2. B.

      64

    3. C.

      8

    4. D.

      16