Digital Communication - Electronic Engineering (MCQ) questions & answers

1)   Graphical representation of linear block code is known as
- Published on 04 Nov 15

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

ANSWER: Tanner graph

Explanation:
No explanation is available for this question!


2)   A linear code
- Published on 04 Nov 15

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  Related Ques

ANSWER: All of the above

Explanation:
No explanation is available for this question!


3)   For decoding in convolution coding, in a code tree,
- Published on 04 Nov 15

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  Related Ques

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
- Published on 04 Nov 15

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

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
- Published on 04 Nov 15

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

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
- Published on 04 Nov 15

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

ANSWER: Information bits

Explanation:
No explanation is available for this question!


7)   Parity bit coding may not be used for
- Published on 04 Nov 15

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

ANSWER: Both a & b

Explanation:
No explanation is available for this question!


8)   Parity check bit coding is used for
- Published on 04 Nov 15

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

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
- Published on 04 Nov 15

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

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
- Published on 04 Nov 15

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

ANSWER: D ≤ dmin - 1

Explanation:
No explanation is available for this question!


1 2 3 4 5 6 7 8 9 10 ...