Access-Control-Methods
March 14, 2024UGC NET CS 2016 July- paper-2
March 14, 2024Computer-Networks
| Question 50 |
Consider the following message M = 1010001101. The cyclic redundancy check (CRC) for this message using the divisor polynomial x5 + x4 + x2 + 1 is:
| 01110 | |
| 01011 | |
| 10101 | |
| 10110 |
Question 50 Explanation:
Degree of generator polynomial is 5. Hence, 5 zeroes is appended before division.
M = 1010001101
append 5 zeroes = M = 101000110100000
∴ CRC = 01110
M = 1010001101
append 5 zeroes = M = 101000110100000
∴ CRC = 01110
Correct Answer: A
Question 50 Explanation:
Degree of generator polynomial is 5. Hence, 5 zeroes is appended before division.
M = 1010001101
append 5 zeroes = M = 101000110100000
∴ CRC = 01110
M = 1010001101
append 5 zeroes = M = 101000110100000
∴ CRC = 01110
Subscribe
Login
0 Comments