Question 834 – Access-Control-Methods
March 14, 2024
Question 3656 – UGC NET CS 2016 July- paper-2
March 14, 2024
Question 834 – Access-Control-Methods
March 14, 2024
Question 3656 – UGC NET CS 2016 July- paper-2
March 14, 2024

Question 11114 – Computer-Networks

Consider the following message M = 1010001101. The cyclic redundancy check (CRC) for this message using the divisor polynomial x5 + x4 + x2 + 1 is:

Correct Answer: A

Question 41 Explanation: 
Degree of generator polynomial is 5. Hence, 5 zeroes is appended before division.
M = 1010001101

append 5 zeroes = M = 101000110100000

∴ CRC = 01110
A
01110
B
01011
C
10101
D
10110
0 0 votes
Article Rating
Subscribe
Notify of
0 Comments
Inline Feedbacks
View all comments
0
Would love your thoughts, please comment.x
()
x
error: Alert: Content selection is disabled!!