CMP424 CMPN324 Assignment#2_2023

ERROR DETECTION AND ETHERNET

A: Delay = number of bits sent / bit rate = 512 / 10 × 106 seconds = 1.2 µs

2. What is the maximum round trip delay for an Ethernet frame operating at 1000Mbit/s If the min.
packet length 64bytes and the maximum packet length 1500 bytes?
A:

3. Compare between the maximum round trip delay for an Ethernet frame operating at 10Mbit/s and
100Mb/s?
A: Assume Min. Frame length = 64 byte = 512 bitsMax. round trip delay
(10 Mbps )= 512 / 10 x 106 = 51.2 μs
Max. round trip delay (100 Mbps )= 512 / 100 x 106 = 51.2 μs

4. An Ethernet LAN with 5 segments each with 180m, and 4 repeaters each repeater introduces a
delay of 3.5 μs and the propagation speed is 1.77×108m/s, calculate the maximum round trip delay.

A: Distance = 5x180=900 m
t = d / v = 900 / (1.77×108) s = 5.084 μs
Delay of repeaters = 4 × 3.5 = 14 μs.
Total Time = 14 + 5.084 = 19.084 μs.
The round-trip delay is twice this value = 38.146 μs

1
5. Given a propagation velocity of 1.77×108 m/s and a delay of 3.5 μs introduced by each repeater,
what is the round trip delay for two computers at either end of a 2500 m link that includes three
repeaters?

A: Distance = 2500 m
t = d / v = 2500 / (1.77×108) = 14.1μs
Delay of repeaters = 3 × 3.5 = 10.5 μs.
Total Time = 10.5 + 14.1 = 24.6 μs.
The round-trip delay is twice this value = 49.2 μs

6. Given a propagation velocity of 1.77×108 m/s and a delay of 3.5 μs introduced by each repeater,
what is the round trip delay for two computers at either end of a 2500 m link that includes three
repeaters?

A: Distance = 2500 m
t = d / v = 2500 / (1.77×108) = 14.1μs
Delay of repeaters = 3 × 3.5 = 10.5 μs.
Total Time = 10.5 + 14.1 = 24.6 μs.
The round-trip delay is twice this value = 49.2 μs

7. Given a propagation velocity of 1.77×108 m/s and a delay of 3.5 µs introduced by each repeater,
what is the round trip delay for two computers (A-D) at either end of a 2000 m link that includes
three repeaters?

A: Distance = 2000 m
t = d / v = 2000 / (1.77×108) =11.2 μs
Delay of repeaters = 3 × 3.5 = 10.5 μs.
2
 Total Time = 10.5 + 11.2 = 21.7 μs.
The round-trip delay is twice this value = 43.4 μs

8. Draw a diagram showing the main error detection and correction techniques used in today's
networking and storage protection against errors.
A:

9. Draw a diagram showing how parity checking is used between the transmitter and the receiver.
A:

3
10. Draw a diagram showing how Cyclic Redundancy Check CRC is used between the transmitter and
the receiver.
A:

11. If data is sent at 1GMbps then calculate the bit duration, if the noise duration is 5μs, how many
bits are lost? If the data rate reduced to 100Mbps, how many bits are lost.
A:

12. Suppose the sender wants to send the word “world’, in ASCII code the 5 characters are coded as”
1110111 1101111 1110010 1101100 1100100
a.What are the actual bits sent if the transmitter and receiver use odd parity
b. What are the actual bits sent if the transmitter and receiver use even parity
A:

4
13. If a receiver receives the following bits of 5 words which are corrupted during transmission:
11111110 11011110 11101100 11011000 11001001, which of the words are corrupted if
odd parity is used and if even parity is used
A:

5
14. Calculate the single even parity check for the word 10011?
A:

15. Calculate the two dimensional (rows and columns) odd parity for the block
10011001 11100010 00100100 10000100?
A:

16. Calculate the checksum for the block 10011001 11100010 00100100 10000100?
A:

17. Explain the roles of CRC in the detection of errors at the packet frame level.
Suppose P(x) = 100100 and Q(x) = 1101, calculate the CRC and what is the data transmitted.
A: No. of CRC bits = No. of bits in generator -1
CRC Bits = 001The actual message = 100100 001

18. Consider a message in form of ( X 7 + X 4 + X 3+ X ) want to be transmitted to a station With a

6
19. Consider a message in form of ( X 9+ X 5 + X 4 + X 3 + X ) want to be transmitted to a station With a
Generator polynomial ( X 5 + X 3+ X +1). Find the CRC bits should inbound into the message.
A: No. of CRC bits = No. of bits in generator -1CRC Bits = 00010The actual
message = 1000111010 00010

20. A communication system is using an even parity between the transmitter and receiver. If the code
received at the receiver is 0110100. What is the actual message being transmitted using Hamming
Code? (Explain).
A: Location of Parity Bits = 2n
c1 = (P1,D3,D5,D7)
= (1 , 1 , 0 , 1 ) = 0
7
c2 = (P2,D3,D6,D7)
= (1 , 1 , 0 , 1 ) = 0
c4 = (P4,D5,D6,D7)
= (1 , 0 , 0 , 1 ) = 1
So bit P4 should change from 1 to 0
Then the actual data is : 1001

21. The receiver receives 1001111 binary numbers then by using hamming code (odd –parity): Show the
correct binary number that transmitted by the sender.
A:
Location of Parity Bits = 2n
c1 = (P1,D3,D5,D7)
= (1 , 1 , 0 , 1 ) = 0
c2 = (P2,D3,D6,D7)
= (1 , 1 , 0 , 1 ) = 0
c4 = (P4,D5,D6,D7)
= (1 , 0 , 0 , 1 ) = 1
So bit P4 should change from 1 to 0
Then the actual data is : 1001

GOOD LUCK