Skip to document

Exercise 1

good exercise
Course

Computer Network

29 Documents
Students shared 29 documents in this course
Academic year: 2021/2022
Uploaded by:
Anonymous Student
This document has been uploaded by a student, just like you, who decided to remain anonymous.
Lebanese International University

Comments

Please sign in or register to post comments.

Preview text

  1. Take the second letter of your first name and convert it to 7-bit ASCII binary code. What bit do you need to add to have even parity?

  2. Take the first two letters of your country of birth and the first two letters of your first name and convert them in ASCII binary. You should now have a sequence of 28 bits. What bits do you need to add and where for LRC with even parity?

  3. In a stop-and-wait error control system, Station A sends packet 0, it arrives without error, and an ACK is returned, but the ACK is lost. What happens next?

  4. What is the hamming distance between 1100110 and 0011100?

  5. What is the hamming distance of the following code: A 01010 1 B 11010 0 C 10101 0 D 01100 1 E 11111 1 F 00000 0 G 01001

0

  1. For the code in 5, is it possible for an error control system to detect and correct two errors?

MASH (Mathematics and Statistics Help) provides drop-in support in mathematics and statistics.

Was this document helpful?

Exercise 1

Course: Computer Network

29 Documents
Students shared 29 documents in this course
Was this document helpful?
1. Take the second letter of your first name and convert it to
7-bit ASCII binary code. What bit do you need to add to
have even parity?
2. Take the first two letters of your country of birth and the
first two letters of your first name and convert them in
ASCII binary. You should now have a sequence of 28 bits.
What bits do you need to add and where for LRC with even
parity?
3. In a stop-and-wait error control system, Station A sends
packet 0, it arrives without error, and an ACK is returned,
but the ACK is lost. What happens next?
4. What is the hamming distance between 1100110 and
0011100?
5. What is the hamming distance of the following code:
A 01010
1
B 11010
0
C 10101
0
D 01100
1
E 11111
1
F 00000
0
G 01001