1. The subnet mask for a particular network is 255.255.31.0.

Which of the following pairs of IP

addresses could belong to this network?
(A) 172.57.88.62 and 172.56.87.233
(B) 128.24.130.33 and 128.24.162.86
(C) 191.203.31.87 and 191.234.31.88
(D) 10.35.28.2 and 10.35.29.4

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

3. Suppose computers A and B have IP addresses 10.105.1.113 and 10.105.1.91 respectively and
they both use the same net mask N. Which of the values of N given below should not be used
if A and B should belong to the same network?
(A) 255.255.255.0
(B) 255.255.255.128
(C) 255.255.255.192
(D) 255.255.255.224

4. In the network 200.10.11.144/27, the fourth octet (in decimal) of the last IP address of the
network which can be assigned to a host is ________

5. Subnet the Class C IP addresses 198.112.56.0. So that you have 8 subnets each with
maximum 12 hosts on each subnet. List the address on host on subnet 1,2,3,8.

6. Subnet the Class C IP address 205.11.2.0 so that you have 16 subnets. What is the subnet
mask for the maximum number of hosts? How many hosts each subnet can have ? What is the
IP address of host 3 on subnet 2?

7. Given a Class B address138.148.56.84. Divide the network into three subnets and give the
subnet mask and number of hosts in each subnet ? Also give the fist and last host ID’s in the
subnets?

8. Given an classless IP address 194.158.52.64/22. Divide the network into three subnets and
give the subnet mask and number of hosts in each subnet? Also give the first and last host
ID’s in the subnets?

9. Given an classless IP address 136.128.52.60/24. Divide the network into VLSM and give the
subnet mask and number of hosts in each subnet? Also give the first and last host ID’s in the
subnets?
10. Consider a network with 6 routers R1 to R6 connected with links having weights as
shown in the following diagram: 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 neighbor 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? (Unused link means there should not be a shortest distance
between the routers Ex: R1 to R2 in the given figure)

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

12. Consider a network with 6 routers R1 to R6 connected as shown below. Consider the hop
count as the metric and apply distance vector routing to find the shortest path?

13. Consider a network with 6 routers R1 to R6 connected with links having weights as
shown in the following diagram: find out the shortest path between R1 and R6 using
shortest path technique.