Question 11 : The most common hamming codes are a generalized version of?
1. Hamming(7, 4) code
2. Hamming(8, 4) code
3. Hamming(6, 3) code
4. Hamming(5, 7) code
View Answer   Discuss with Members

Question 12 : What is the total block length 'n' of a Hamming code?
1. 2^r
2. 2^r-1
3. 2^r-1-1
4. 2^r+1
View Answer   Discuss with Members

Question 13 : For a hamming code of parity bit m=8, what is the total bits and data bits?
1. (255, 247)
2. (127, 119)
3. (31, 26)
4. (0, 8)
View Answer   Discuss with Members

Question 14 : Who invented Hamming codes?
1. Richard Hamming
2. Ross Hamming
3. Shannon
4. Huffman
View Answer   Discuss with Members

Question 15 : What is the rate of hamming codes?
1. 1-[r/(2^r-1)]
2. 1-(r/2^r)
3. 1+(r/2^r)
4. r/2^r+1
View Answer   Discuss with Members

Question 16 : What is the minimal Hamming distance between any two correct codewords?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members

Question 17 : The worst-case efficiency of solving a problem in polynomial time is?
1. O(p(n))
2. O(p( n log n))
3. O(p(n²))
4. O(p(m log n))
View Answer   Discuss with Members

Question 18 : Problems that cannot be solved by any algorithm are called?
1. tractable problems
2. intractable problems
3. undecidable problems
4. decidable problems
View Answer   Discuss with Members

Question 19 : Problems that can be solved in polynomial time are known as?
1. intractable
2. tractable
3. decision
4. complete
View Answer   Discuss with Members

Question 20 : ________ is the mechanism of sending data bits multiple times to ensure consistency.
1. Repetition
2. Duplication
3. Mirroring
4. Redundancy
View Answer   Discuss with Members