GATEverse
← GATE IT 2005

Q78

MCQ2 marks, −0.5

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

Sign in to save attempts.

Loading…