Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | Gate IT 2005 | Question 78

  • Difficulty Level : Easy
  • Last Updated : 03 Sep, 2021

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

(A) 01110
(B) 01011
(C) 10101
(D) 10110

Answer: (A)


Attention reader! Don’t stop learning now.  Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.

Learn all GATE CS concepts with Free Live Classes on our youtube channel.

M = 1010001101
Divisor polynomial: 1.x5 +1.x4+0.x3+1.x2+0.x2+1.x0   
Divisor polynomial bit= 110101
Bits to be appended to message= (divisor polynomial bits – 1) = 5
Append 5 zeros to message bits, modified message: 101000110100000

Now, divide and XOR the message with divisor polynomial bits. Make resultant reminder to 5 bit again and that is the CRC send along with the message.


This explanation has been contributed by Sandeep Pandey.

Please visit the following links to learn more on CRC and its calculation:

Wikipedia article: Cyclic Redundancy Check
GeeksforGeeks article: Error Detection | Computer Networks

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :