Question 1 : For a graph of degree three, in what time can a Hamiltonian path be found?
1. O(0.251ⁿ)
2. O(0.401ⁿ)
3. O(0.167ⁿ)
4. O(0.151ⁿ)
View Answer   Discuss with Members

Question 2 : In graphs, in which all vertices have an odd degree, the number of Hamiltonian cycles through any fixed edge is always even.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 3 : 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 4 : What is the code rate of a repetition Hamming code (3, 1)?
1. 1
2. 3
3. 1/3
4. 1.3
View Answer   Discuss with Members

Question 5 : What is the code rate of a repetition Hamming code (3, 1)?
1. 1
2. 3
3. 1/3
4. 1.3
View Answer   Discuss with Members

Question 6 : Hamming codes can be used for both single-bit error and burst error detection and correction.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 7 : An Extended hamming code is also called as __________
1. SEDDEC
2. SEDDED
3. SECDED
4. SECDEC
View Answer   Discuss with Members

Question 8 : Which of the following problems is similar to that of a Hamiltonian path problem?
1. knapsack problem
2. closest pair problem
3. travelling salesman problem
4. assignment problem
View Answer   Discuss with Members

Question 9 : Why do we require hamming codes?
1. Error correction
2. Encryption only
3. Decryption
4. Bit stuffing
View Answer   Discuss with Members

Question 10 : A two-out-of-five code consists of _________
1. Two 0s and three 1s
2. Three 0s and two 1s
3. Four 0s and one 1s
4. One 0s and four 1s
View Answer   Discuss with Members