Assignment Module 2

Question 1: The distance vector routing algorithm is used. Router P has measured its
routes to its neighbours Q, R and S as 3, 7 and 2 respectively. P has received the
following vectors from node Q: (P, Q, R, S, T, U) [3, 0, 1, 4, 7, 5], from node R: (P, Q, R,
S, T, U) [7, 4, 0, 6, 8, 7] and from node S: ( P, Q, R, S, T, U) [2, 5, 7, 0, 4, 2]. What will be
the state of routing table of router table P?

Question 2: What is the basis of classification for the four types of links defined by
OSPF?

Question 3: Why do OSPF messages propagate faster than RIP messages?

Question 4: A bit stream 1101011011 is transmitted using the standard CRC method.
The generator polynomial is x4+x+1. What is the actual bit string transmitted?

Question 5: A bit stream 10011101 is transmitted using the standard CRC method. The
generator polynomial is x3+1.

1. What is the actual bit string transmitted?

2. Suppose the third bit from the left is inverted during transmission. How will
receiver detect this error?

Question 6: What is the minimal Hamming distance between any two correct
codewords?

Question 7: It the receiver Joe receives 10010100101 from Alice. Check whether the
received message is correct or not. (Hint: message is encoded using hamming code)

Question 8: Suppose a router receives an IP packet containing 600 data bytes and has
to forward the packet to a network with maximum transmission unit of 200 bytes.
Assume that IP header is 20 bytes long. What are fragment offset values for divided
packets?
Question 9: The value of the total length field in an IP datagram is 36, and the value of
the header length field is 5. How many bytes of data is packet carrying?
Question 10: Which fields in the IP header remain the same as the packet travels from
the source host to destination host?
Question 11: The following data fragment occurs in the middle of a data stream for
which the byte stuffing algorithm described in the text is used:

A B ESC C ESC FLAG FLAG D

What is the output after stuffing?

Question 12:  What is the maximum overhead in byte-stuffing algorithm?

 Question 13:  The following character encoding is used in a data link protocol:

A 01000111 B 11100011 FLAG 01111110 ESC 11100000

Show the bit sequence transmitted (in binary) for the four-character frame A B ESC
FLAG when each of the following framing methods is used:

(a) Flag bytes with byte stuffing.

(b) Starting and ending flag bytes with bit stuffing.

Question 14: An organization is granted a block of classless addresses with the starting
address 199.34.32.0/27. How many addresses are granted?

Question 15: An organization is granted the block 21.17.18.10/25. The administrator

wants to create 3 subnets each of size 64, 32 and 32.Find the subnet mask. Also find the
first address and last address of each subnet.

Question 16: Find the range of addresses in a block of classless addresses if one of the
addresses is 200.17.21.135/27.

Question 17: An organization is granted a class C network 210.1.2.0. The administrator

wants to create 4 subnets each of size 64, 32, 16 and 16.Find the first address and last
address of each subnet. Find the subnet mask of each subnet.