Coding - Electronic Engineering (MCQ) questions & answers

1)   Graphical representation of linear block code is known as

a. Pi graph
b. Matrix
c. Tanner graph
d. None of the above
Answer  Explanation 

ANSWER: Tanner graph

Explanation:
No explanation is available for this question!
2)   A linear code

a. Sum of code words is also a code word
b. All-zero code word is a code word
c. Minimum hamming distance between two code words is equal to weight of any non zero code word
d. All of the above
Answer  Explanation 

ANSWER: All of the above

Explanation:
No explanation is available for this question!
3)   For decoding in convolution coding, in a code tree,

a. Diverge upward when a bit is 0 and diverge downward when the bit is 1
b. Diverge downward when a bit is 0 and diverge upward when the bit is 1
c. Diverge left when a bit is 0 and diverge right when the bit is 1
d. Diverge right when a bit is 0 and diverge left when the bit is 1
Answer  Explanation 

ANSWER: Diverge upward when a bit is 0 and diverge downward when the bit is 1

Explanation:
No explanation is available for this question!
4)   The code in convolution coding is generated using

a. EX-OR logic
b. AND logic
c. OR logic
d. None of the above
Answer  Explanation 

ANSWER: EX-OR logic

Explanation:
No explanation is available for this question!
5)   Interleaving process permits a burst of B bits, with l as consecutive code bits and t errors when

a. B ≤ 2tl
b. B ≥ tl
c. B ≤ tl/2
d. B ≤ tl
Answer  Explanation 

ANSWER: B ≤ tl

Explanation:
No explanation is available for this question!
6)   For a (7, 4) block code, 7 is the total number of bits and 4 is the number of

a. Information bits
b. Redundant bits
c. Total bits- information bits
d. None of the above
Answer  Explanation 

ANSWER: Information bits

Explanation:
No explanation is available for this question!
7)   Parity bit coding may not be used for

a. Error in more than single bit
b. Which bit is in error
c. Both a & b
d. None of the above
Answer  Explanation 

ANSWER: Both a & b

Explanation:
No explanation is available for this question!
8)   Parity check bit coding is used for

a. Error correction
b. Error detection
c. Error correction and detection
d. None of the above
Answer  Explanation 

ANSWER: Error detection

Explanation:
No explanation is available for this question!
9)   For hamming distance dmin and t errors in the received word, the condition to be able to correct the errors is

a. 2t + 1 ≤ dmin
b. 2t + 2 ≤ dmin
c. 2t + 1 ≤ 2dmin
d. Both a and b
Answer  Explanation 

ANSWER: Both a and b

Explanation:
No explanation is available for this question!
10)   For hamming distance dmin and number of errors D, the condition for receiving invalid codeword is

a. D ≤ dmin + 1
b. D ≤ dmin - 1
c. D ≤ 1 - dmin
d. D ≤ dmin
Answer  Explanation 

ANSWER: D ≤ dmin - 1

Explanation:
No explanation is available for this question!
1 2

Related Content

▲