COMPUTER NETWORK - UNIT- II

Consider the following code words (0011,0101,1010) in a linear code , then which of the given options is not a code word of linear code

• 0110

• 1001

• 1111

• 0001

2. Error detecting at data link layer is achieved by

• Equalization

• Bit stuffing

• Hamming codes

• Cyclic Redundancy code

In CRC if the unit is 100111001 and the divisor is 1011 the what is dividend at the receiver?

• 100111001101

• 100111001011

• 100111001

• 100111001110

Which of the following is /are the popular techniques for error detection?

• Cyclic redundancy check

• Simple parity check

• Checksum

• All of the options

In ___________ coding , we divide our message into block, each of k bits, called

• Block ,Blockwords

• Linear, Datawords

• Block, Datawords

• None of the above

The ______________ between two words is the number of differences between corresponding bits

• Hamming code

• Hamming distance

• Hamming rule

• None of the above

We add redundant bit to each block to make the length n=k+r. the resulting n bit blocked are called ___________

• Data words

• block words

• Code words

• None of the above

To guarantee the detection of up to 5 errors in all cases, the minmum hamming distance in a block code must be

• 5

• 6

• 11

• None of the above

A Simple parity check code can delete __________ errors

• An even number

• Two

• No errors

• An odd number

________________ codes are special linear block codes with one extra property. if a code word is rotated, the result is another code word.

• Non Linear

• Convolution

• Cyclic

• None of the above