Scribd
Upload
65 views2 pages

CNAssignment DLL

This document contains 22 questions about computer network concepts like data encoding, framing, error detection, and correction. The questions cover topics such as character encoding, byte stuffing, bit stuffing, Hamming codes, CRC, LRC, and parity checks.

Uploaded by

Shivanshu Saxena
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
65 views2 pages

CNAssignment DLL

This document contains 22 questions about computer network concepts like data encoding, framing, error detection, and correction. The questions cover topics such as character encoding, byte stuffing, bit stuffing, Hamming codes, CRC, LRC, and parity checks.

Uploaded by

Shivanshu Saxena
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Computer Networks (TCS-602)

Assignment 1

1. 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 4-character frame: A B ESC
FLAG when each of the following framing methods is used:
(a) Character Count.
(b) Flag byte with byte stuffing
(c) Starting and ending flag bytes, with bit stuffing.

2. 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?

3. A bit string, 0111101111101111110, needs to be transmitted at the data link


layer. What is the string actually transmitted after bit stuffing?

4. 16-bit messages are transmitted using a Hamming code. How many check bits are
needed to insure that the receiver can detect and correct single bit errors? Show
the bit pattern transmitted for the message 1101001100110101. Assume that even
parity is used in the Hamming code.

5. An 8-bit byte with binary value 10101111 is to be encoded using an even-parity


Hamming code. What is the binary value after encoding?

6. A 12-bit hamming code whose hexadecimal value is 0xE4F arrives at a receiver.


What was the original value in hexadecimal? Assume that not more than 1 bit is
in error.

7. A block of bits with n rows and k columns uses horizontal and vertical parity bits
for error detection. Suppose that exactly 4 bits are inverted due to transmission
errors. Derive an expression for the probability that the error will be undetected.

8. What is the remainder obtained by dividing x7 + x5 + 1 by the generator


polynomial x3 + 1?

9. A bit stream 10011101 is transmitted using the standard CRC method described in
the text. The generator polynomial is x3 + 1. Show the actual bit string transmitted.
Suppose the third bit from the left is inverted during transmission. Show that this
error is detected at the receiver’s end.

10. A receiver receives the bit pattern 01101011. If the system is using even parity
VRC, is the pattern in error?
11. Find the LRC for the following block of data.
10011001 01101111

12. Given a 10-bit sequence 1010011110 and a divisor of 1011, find the CRC. Check
your answer.

13. Given a remainder of 111, a data unit of 10110011, and a divisor 1001, is there an
error in the data unit?

14. Find the checksum for the following bit sequence. Assume a 16-bit segment size.
1001001110010011
1001100001001101

15. For each data unit of the following sizes, find the minimum number of
redundancy bits needed to correct one single-bit error:
A. 12
B. 16
C. 24
D. 64

16. Construct the hamming code for the bit sequence 10011101.

17. Calculate the VRC and LRC for the following bit pattern using even parity:
0011101 1100111 1111111 0000000

18. The following block uses even-parity LRC. Which bits are in error?
10010101 01001111 11010000 11011011

19. A system uses LRC on a block of 8 bytes. How many redundant bits are sent per
block? What is the ratio of useful bits to the total bits?

20. A receiver receives the code 11001100111. When it uses the Hamming-encoding
algorithm, the result is 0101. Which bit is in error? What is the correct code?

21. In single bit error correction, a code of three bits can be in one of four stages: no
error, first bit in error, second bit in error, and third bit in error. How many of
these three bits should be redundant to correct this code? How many bits can be
the actual data?

22. The code 11110101101 was received. Using the Hamming-encoding algorithm,
what is the original code sent?

You might also like