My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Computer Networks - Computer Science & Information Technology Previous Year Questions

Practice Computer Networks - Computer Science & Information Technology previous year questions organised from real papers, with year-wise coverage and clear topic navigation.

25Papers
15Years
120Questions
1Topics

Computer Networks question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Computer Networks. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 60 50%
Easy 59 49.2%
Hard 1 0.8%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 71 59.2%
Numerical Answer Type (NAT) 36 30%
MSQ 13 10.8%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
120 Qs

Most asked topics

Top topics across the included previous year papers.

Computer Networks
120 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Network Layers and Switching
50 Qs
TCP, Socket Interfaces and Application Protocols
38 Qs
Data-link Protocols and Error Detection
22 Qs
Routing and IPv4
10 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Computer Science and Information Technology (CS) 2026
6 Qs
Computer Science and Information Technology (CS) 2026
5 Qs
Computer Science & Information Technology (CS) 2025 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2025 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
6 Qs
Computer Science & Information Technology (CS) 2024 [Session 2]
6 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2021 [Session 1]
4 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2020 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2019 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2018 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2016 [Session 1]
5 Qs
Computer Science & Information Technology (CS) 2016 [Session 2]
5 Qs
Computer Science & Information Technology (CS) 2015 [Session 2]
3 Qs
Computer Science & Information Technology (CS) 2014 [Session 1]
6 Qs
Computer Science & Information Technology (CS) 2014 [Session 2]
6 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
6 Qs
Computer Science & Information Technology (CS) 2013 [Session 1]
6 Qs
Computer Science & Information Technology (CS) 2013 [Session 3]
5 Qs
Computer Science & Information Technology (CS) 2013 [Session 4]
5 Qs
Computer Science & Information Technology (CS) 2013 [Session 2]
4 Qs
Computer Science & Information Technology (CS) 2009
2 Qs

Browse by subtopics

Open a focused page built from the same verified paper data.

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Computer Science and Information Technology (CS) 202620265View paper
Computer Science and Information Technology (CS) 202620266View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20254View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20255View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20246View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20246View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20235View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20225View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20214View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20214View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20203View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20194View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20185View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20175View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20165View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20165View paper
Computer Science & Information Technology (CS) 2015 [Session 2]20153View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20146View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20146View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20146View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20136View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20134View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20135View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20135View paper
Computer Science & Information Technology (CS) 200920092View paper

Sample previous year questions

A varied preview from the papers represented in this selection, with every available option.

1
2009 · Computer Science & Information Technology · Computer Networks · TCP, Socket Interfaces and Application Protocols
Computer Science & Information Technology (CS) 2009
While opening a TCP connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low order 32 bits of the counter of the ToD clock is to be used for the initial sequence numbers. The clock counter increments once per millisecond. The maximum packet lifetime is given to be 64s.
Which one of the choices given below is closest to the minimum permissible rate at which sequence numbers used for packets of a connection can increase ?
Open complete paper
2
2013 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2013 [Session 1]
Match the problem domains in GROUP I with the solution technologies in GROUP II.
GROUP IGROUP II
(P) Service oriented computing(1) Interoperability
(Q) Heterogeneous communicating systems(2) BPMN
(R) Information representation(3) Publish-find-bind
(S) Process description(4) XML
Open complete paper
3
2013 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2013 [Session 2]
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D.
Open complete paper
4
2013 · Computer Science & Information Technology · Computer Networks · TCP, Socket Interfaces and Application Protocols
Computer Science & Information Technology (CS) 2013 [Session 3]
Using public key cryptography, X adds a digital signature σ to message M, encrypts <M, σ>, and sends it to Y, where it is decrypted. Which one of the following sequences of keys is used for the operations?
Open complete paper
5
2013 · Computer Science & Information Technology · Computer Networks · TCP, Socket Interfaces and Application Protocols
Computer Science & Information Technology (CS) 2013 [Session 4]
The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are
Open complete paper
6
2014 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2014 [Session 1]
Consider the following three statements about link state and distance vector routing protocols, for a large network with 500 network nodes and 4000 links.
[S1] The computational overhead in link state protocols is higher than in distance vector protocols.
[S2] A distance vector protocol (with split horizon) avoids persistent routing loops, but not a link state protocol.
[S3] After a topology change, a link state protocol will converge faster than a distance vector protocol.
Which one of the following is correct about S1, S2, and S3 ?
Open complete paper