Practice Library

Data Structure And Algorithm: Practice MCQ Questions and Answers

Browse topic-based Data Structure And Algorithm practice sets to strengthen concepts and improve problem-solving skills.

289 practice setsPage 15 of 15

18 topics

Dynamic Programming167 Searching Algorithms31 String Matching Algorithm20 Checksum15+14 more

Data Structure And AlgorithmMediumChecksum Hamming Code

281.

A two-out-of-five code consists of:

Two 0s and three 1s

Three 0s and two 1s

Four 0s and one 1

One 0 and four 1s

Answer and explanation

Correct Answer: B — Three 0s and two 1s

A two-out-of-five code consists of three 0s and two 1s, giving ten possible combinations to represent digits 0–9.

Data Structure And AlgorithmMediumChecksum Hamming Code

282.

What is the rate of hamming codes?

1 - r/(2^r - 1)

1 - r/2^r

1 + r/2^r

r/2^r + 1

Answer and explanation

Correct Answer: A — 1 - r/(2^r - 1)

Rate of a hamming code = message length / block length = (2^r - r - 1) / (2^r - 1) = 1 - r/(2^r - 1). It is the highest rate for a minimum distance of 3.

Data Structure And AlgorithmMediumChecksum Hamming Code

283.

What is the message length 'k' of a Hamming(7, 4) code?

2^r - 1

2^r - r + 1

2^r - r - 1

2^(r+1) - r

Answer and explanation

Correct Answer: C — 2^r - r - 1

For a Hamming(7, 4) code, the message length k = 2^r - r - 1, where r is the number of parity bits. Here r = 3, so k = 4.

Data Structure And AlgorithmMediumChecksum Hamming Code

284.

What is the total block length 'n' of a Hamming code?

2^r

2^r - 1

2^(r-1) - 1

2^r + 1

Answer and explanation

Correct Answer: B — 2^r - 1

For a Hamming(7, 4) code, the block length n = 2^r - 1, where r is the number of parity bits. Here r = 3, so n = 7.

Data Structure And AlgorithmMediumChecksum Hamming Code

285.

Who invented Hamming codes?

Richard Hamming

Ross Hamming

Shannon

Huffman

Answer and explanation

Correct Answer: A — Richard Hamming

Richard W. Hamming invented hamming codes at Bell Telephone Laboratory to minimize errors in punched card readers. Huffman invented Huffman codes. Shannon invented Shannon-Fano codes.

Data Structure And AlgorithmMediumChecksum Hamming Code

286.

Hamming codes can be used for both single-bit error and burst error detection and correction.

True

False

Answer and explanation

Correct Answer: B — False

Hamming codes are suitable only for single-bit error detection and correction, and two-bit error detection. They are very unlikely to detect burst errors.

Page 15 of 15 · 289 results

Prev15 / 15Next

First Prev 114 15Next

Printing this content is disabled

Data Structure And Algorithm: Practice MCQ Questions and Answers