My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

Routing and IPv4 - Computer Networks - Computer Science & Information Technology Previous Year Questions

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

9Papers
9Years
12Questions
1Topics

Routing and IPv4 question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Routing and IPv4. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 8 66.7%
Easy 4 33.3%

Question type distribution

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

MCQ 5 41.7%
Numerical Answer Type (NAT) 4 33.3%
MSQ 3 25%

Subject weightage

Top subjects by unique question coverage.

Computer Science & Information Technology
12 Qs

Most asked topics

Top topics across the included previous year papers.

Computer Networks
12 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Routing and IPv4
12 Qs

Paper coverage

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

Computer Science & Information Technology (CS) 2025 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2024 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2023 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2022 [Session 2]
2 Qs
Computer Science & Information Technology (CS) 2021 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2017 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2015 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2014 [Session 3]
1 Qs
Computer Science & Information Technology (CS) 2010
2 Qs

Included previous year papers

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

PaperYear / sessionQuestions in this viewOpen
Computer Science & Information Technology (CS) 2025 [Session 1]20251View paper
Computer Science & Information Technology (CS) 2024 [Session 1]20241View paper
Computer Science & Information Technology (CS) 2023 [Session 2]20232View paper
Computer Science & Information Technology (CS) 2022 [Session 2]20222View paper
Computer Science & Information Technology (CS) 2021 [Session 2]20211View paper
Computer Science & Information Technology (CS) 2017 [Session 2]20171View paper
Computer Science & Information Technology (CS) 2015 [Session 2]20151View paper
Computer Science & Information Technology (CS) 2014 [Session 3]20141View paper
Computer Science & Information Technology (CS) 201020102View paper

All Routing and IPv4 previous year questions

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

1
2010 · Computer Science & Information Technology · Computer Networks · Routing and IPv4
Computer Science & Information Technology (CS) 2010
All the routers use the distance vector based routing algorithm to update their routing tables. Each router starts with its routing table initialized to contain an entry for each neighbour with the weight of the respective connecting link. After all the routing tables stabilize, how many links in the network will never be used for carrying any data?

Question diagram

Open complete paper
2
2010 · Computer Science & Information Technology · Computer Networks · Routing and IPv4
Computer Science & Information Technology (CS) 2010

Suppose the weights of all unused links in the previous question are changed to 2 and the distance vector algorithm is used again until all routing tables stabilize. How many links will now remain unused?

Open complete paper
3
2014 · Computer Science & Information Technology · Computer Networks · Routing and IPv4
Computer Science & Information Technology (CS) 2014 [Session 3]
An IP router implementing Classless Inter-domain Routing (CIDR) receives a packet with address 131.23.151.76. The router's routing table has the following entries:
PrefixOutput Interface Identifier
131.16.0.0/ 123
131.28.0.0/ 145
131.19.0.0/ 162
131.22.0.0/ 151
The identifier of the output interface on which this packet will be forwarded is ______.

Question diagram

Open complete paper
4
2015 · Computer Science & Information Technology · Computer Networks · Routing and IPv4
Computer Science & Information Technology (CS) 2015 [Session 2]
Consider the following routing table at an IP router:
Network No.Net MaskNext Hop
128.96.170.0255.255.254.0Interface 0
128.96.168.0255.255.254.0Interface 1
128.96.166.0255.255.254.0R2
128.96.164.0255.255.252.0R3
0.0.0.0DefaultR4

For each IP address in Group I identify the correct choice of the next hop from Group II using the entries from the routing table above.
Group IGroup II
i) 128.96.171.92a) Interface 0
ii) 128.96.167.151b) Interface 1
iii) 128.96.163.151c) R2
iv) 128.96.165.121d) R3
e) R4

(A) i-a, ii-c, iii-e, iv-d
(B) i-a, ii-d, iii-b, iv-e
(C) i-b, ii-c, iii-d, iv-e
(D) i-b, ii-c, iii-e, iv-d

Question diagram

Open complete paper
5
2017 · Computer Science & Information Technology · Computer Networks · Routing and IPv4
Computer Science & Information Technology (CS) 2017 [Session 2]
Consider the following statements about the routing protocols. Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) in an IPv4 network.
I. RIP uses distance vector routing
II. RIP packets are sent using UDP
III. OSPF packets are sent using TCP
IV. OSPF operation is based on link-state routing
Which of the statements above are CORRECT?
Open complete paper
6
2021 · Computer Science & Information Technology · Computer Networks · Routing and IPv4
Computer Science & Information Technology (CS) 2021 [Session 2]
Consider a computer network using the distance vector routing algorithm in its network layer. The partial topology of the network is as shown below.

The objective is to find the shortest-cost path from the router R to routers P and Q. Assume that R does not initially know the shortest routes to P and Q. Assume that R has three neighbouring routers denoted as X, Y, and Z. During one iteration, R measures its distance to its neighbours X, Y, and Z as 3, 2, and 5, respectively. Router R gets routing vectors from its neighbours that indicate that the distance to router P from routers X, Y, and Z are 7, 6, and 5, respectively. The routing vector also indicates that the distance to router Q from routers X, Y, and Z are 4, 6, and 8, respectively. Which of the following statement(s) is/are correct with respect to the new routing table of R, after updation during this iteration?

Question diagram

Open complete paper
7
2022 · Computer Science & Information Technology · Computer Networks · Routing and IPv4
Computer Science & Information Technology (CS) 2022 [Session 2]

Consider routing table of an organization’s router shown below:

Subnet NumberSubnet MaskNext Hop
12.20.164.0255.255.252.0R1
12.20.170.0255.255.254.0R2
12.20.168.0255.255.254.0Interface 0
12.20.166.0255.255.254.0Interface 1
defaultR3
Which of the following prefixes in CIDR notation can be collectively used to correctly aggregate all of the subnets in the routing table?
Open complete paper
8
2022 · Computer Science & Information Technology · Computer Networks · Routing and IPv4
Computer Science & Information Technology (CS) 2022 [Session 2]
Consider a network with three routers P, Q, R shown in the figure below. All the links have cost of unity.

[Diagram: P -- Q -- R]

The routers exchange distance vector routing information and have converged on the routing tables, after which the link Q–R fails. Assume that P and Q send out routing updates at random times, each at the same average rate. The probability of a routing loop formation (rounded off to one decimal place) between P and Q, leading to count-to-infinity problem, is __________.

Question diagram

Open complete paper
9
2023 · Computer Science & Information Technology · Computer Networks · Routing and IPv4
Computer Science & Information Technology (CS) 2023 [Session 2]
Which of the following statements is/are INCORRECT about the OSPF (Open Shortest Path First) routing protocol used in the Internet?
Open complete paper
10
2023 · Computer Science & Information Technology · Computer Networks · Routing and IPv4
Computer Science & Information Technology (CS) 2023 [Session 2]
The forwarding table of a router is shown below.
Subnet NumberSubnet MaskInterface ID
200.150.0.0255.255.0.01
200.150.64.0255.255.224.02
200.150.68.0255.255.255.03
200.150.68.64255.255.255.2244
Default0

A packet addressed to a destination address 200.150.68.118 arrives at the router. It will be forwarded to the interface with ID ________.
Open complete paper
11
2024 · Computer Science & Information Technology · Computer Networks · Routing and IPv4
Computer Science & Information Technology (CS) 2024 [Session 1]
Consider the entries shown below in the forwarding table of an IP router. Each entry consists of an IP prefix and the corresponding next hop router for packets whose destination IP address matches the prefix. The notation "/N" in a prefix indicates a subnet mask with the most significant N bits set to 1.
PrefixNext hop router
10.1.1.0/24R1
10.1.1.128/25R2
10.1.1.64/26R3
10.1.1.192/26R4

This router forwards 20 packets each to 5 hosts. The IP addresses of the hosts are 10.1.1.16, 10.1.1.72, 10.1.1.132, 10.1.1.191, and 10.1.1.205. The number of packets forwarded via the next hop router R2 is ________
Open complete paper
12
2025 · Computer Science & Information Technology · Computer Networks · Routing and IPv4
Computer Science & Information Technology (CS) 2025 [Session 1]
A packet with the destination IP address 145.36.109.70 arrives at a router whose routing table is shown. Which interface will the packet be forwarded to?
Open complete paper