My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Network Layers and Switching - Computer Networks - Computer Science & Information Technology Previous Year Questions

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

25Papers
16Years
56Questions
1Topics

Network Layers and Switching question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Network Layers and Switching. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Easy 30 53.6%
Medium 26 46.4%

Question type distribution

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

MCQ 39 69.6%
Numerical Answer Type (NAT) 13 23.2%
MSQ 4 7.1%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
56 Qs

Most asked topics

Top topics across the included previous year papers.

Computer Networks
56 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Network Layers and Switching
56 Qs

Paper coverage

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

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

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) 202620261View paper
Computer Science and Information Technology (CS) 202620263View paper
Computer Science & Information Technology (CS) 2025 [Session 1]20252View paper
Computer Science & Information Technology (CS) 2025 [Session 2]20253View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20244View paper
Computer Science & Information Technology (CS) 2024 [Session 2]20244View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20222View paper
Computer Science & Information Technology (CS) 2021 [Session 1]20211View paper
Computer Science & Information Technology (CS) 2020 [Session 2]20201View paper
Computer Science & Information Technology (CS) 2019 [Session 2]20192View paper
Computer Science & Information Technology (CS) 2018 [Session 2]20181View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20172View paper
Computer Science & Information Technology (CS) 2016 [Session 1]20162View paper
Computer Science & Information Technology (CS) 2016 [Session 2]20162View paper
Computer Science & Information Technology (CS) 2015 [Session 2]20151View paper
Computer Science & Information Technology (CS) 2014 [Session 1]20142View paper
Computer Science & Information Technology (CS) 2014 [Session 2]20144View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20144View paper
Computer Science & Information Technology (CS) 2013 [Session 1]20133View paper
Computer Science & Information Technology (CS) 2013 [Session 2]20132View paper
Computer Science & Information Technology (CS) 2013 [Session 3]20132View paper
Computer Science & Information Technology (CS) 2013 [Session 4]20132View paper
Computer Science & Information Technology (CS) 201020102View paper
Computer Science & Information Technology (CS) 200820082View paper
Computer Science & Information Technology (CS) 200720072View paper

All Network Layers and Switching previous year questions

Practice every matching question in batches of 20, with every available option.

1
2007 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2007

The address of a class B host is to be split into subnets with a 6-bit subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet?

Open complete paper
2
2007 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2007
Match the following:
P. SMTP      1. Application layer
Q. BGP      2. Transport layer
R. TCP      3. Data link layer
S. PPP      4. Network layer
                   5. Physical layer
Open complete paper
3
2008 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2008

If a class B network on the Internet has a subnet mask of 255.255.248.0, what is the maximum number of hosts per subnet?

Open complete paper
4
2008 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2008

A computer on a 10Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2Mbps. It is initially filled to capacity with 16 Megabits. What is the maximum duration for which the computer can transmit at the full 10Mbps?

Open complete paper
5
2010 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2010

One of the header fields in an IP datagram is the Time-to-Live (TTL) field. Which of the following statements best explains the need for this field?

Open complete paper
6
2010 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2010
Suppose computers A and B have IP addresses 10.105.1.113 and 10.105.1.91 respectively and they both use the same netmask N. Which of the values of N given below should not be used if A and B should belong to the same network?
Open complete paper
7
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
8
2013 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2013 [Session 1]

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.

Question diagram

Open complete paper
9
2013 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2013 [Session 1]

In an IPv4 datagram, the M bit is 0, the value of HLEN is 10, the value of total length is 400 and the fragment offset value is 300. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, respectively are

Open complete paper
10
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
11
2014 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2014 [Session 1]
Identify the correct order in which the following actions take place in an interaction between a web browser and a web server.
1. The web browser requests a webpage using HTTP.
2. The web browser establishes a TCP connection with the web server.
3. The web server sends the requested webpage using HTTP.
4. The web browser resolves the domain name using DNS.
Open complete paper
12
2014 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2014 [Session 2]
Which one of the following is TRUE about the interior gateway routing protocols – Routing Information Protocol (RIP) and Open Shortest Path First (OSPF)?
Open complete paper
13
2014 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2014 [Session 2]
In the diagram shown below, L1 is an Ethernet LAN and L2 is a Token-Ring LAN. An IP packet originates from sender S and traverses to R, as shown. The links within each ISP and across the two ISPs, are all point-to-point optical links. The initial value of the TTL field is 32. The maximum possible value of the TTL field when R receives the datagram is ____________.

Question diagram

Open complete paper
14
2014 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2014 [Session 2]
Consider the store and forward packet switched network given below. Assume that the bandwidth of each link is \(10^6\) bytes / sec. A user on host A sends a file of size \(10^3\) bytes to host B through routers R1 and R2 in three different ways. In the first case a single packet containing the complete file is transmitted from A to B. In the second case, the file is split into 10 equal parts, and these packets are transmitted from A to B. In the third case, the file is split into 20 equal parts and these packets are sent from A to B. Each packet contains 100 bytes of header information along with the user data. Consider only transmission time and ignore processing, queuing and propagation delays. Also assume that there are no errors during transmission. Let T1, T2 and T3 be the times taken to transmit the file in the first, second and third case respectively. Which one of the following is CORRECT?

Question diagram

Open complete paper
15
2014 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2014 [Session 2]
An IP machine Q has a path to another IP machine H via three IP routers R1, R2, and R3.
Q—R1—R2—R3—H
H acts as an HTTP server, and Q connects to H via HTTP and downloads a file. Session layer encryption is used, with DES as the shared key encryption protocol. Consider the following four pieces of information:
[I1] The URL of the file downloaded by Q
[I2] The TCP port numbers at Q and H
[I3] The IP addresses of Q and H
[I4] The link layer addresses of Q and H
Which of I1, I2, I3, and I4 can an intruder learn through sniffing at R2 alone?
Open complete paper
16
2014 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2014 [Session 3]
In the following pairs of OSI protocol layer/sub-layer and its functionality, the INCORRECT pair is
Open complete paper
17
2014 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2014 [Session 3]
Host A (on TCP/IP v4 network A) sends an IP datagram D to host B (also on TCP/IP v4 network B). Assume that no error occurred during the transmission of D. When D reaches B, which of the following IP header field(s) may be different from that of the original datagram D?
(i) TTL    (ii) Checksum    (iii) Fragment Offset
Open complete paper
18
2014 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2014 [Session 3]
Every host in an IPv4 network has a 1-second resolution real-time clock with battery backup. Each host needs to generate up to 1000 unique identifiers per second. Assume that each host has a globally unique IPv4 address. Design a 50-bit globally unique ID for this purpose. After what period (in seconds) will the identifiers generated by a host wrap around?
Open complete paper
19
2014 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2014 [Session 3]
An IP router with a Maximum Transmission Unit (MTU) of 1500 bytes has received an IP packet of size 4404 bytes with an IP header of length 20 bytes. The values of the relevant fields in the header of the third IP fragment generated by the router for this packet are
Open complete paper
20
2015 · Computer Science & Information Technology · Computer Networks · Network Layers and Switching
Computer Science & Information Technology (CS) 2015 [Session 2]
Host A sends a UDP datagram containing 8880 bytes of user data to host B over an Ethernet LAN. Ethernet frames may carry up to 1500 bytes (i.e. MTU=1500 bytes). Size of UDP header is 8 bytes and size of IP header is 20 bytes. There is no option field in IP header. How many total number of IP fragments will be transmitted and what will be the contents of offset field in the last fragment?
(A) 6 and 925
(B) 6 and 7400
(C) 7 and 1110
(D) 7 and 8880
Open complete paper

Showing 20 of 48 questions