Multiple Choice
Which of the following algorithms is the best approach for solving Huffman codes?
A) exhaustive search
B) greedy algorithm
C) brute force algorithm
D) divide and conquer algorithm
Correct Answer:
Verified
Correct Answer:
Verified
Q20: Sum of a periodic and aperiodic signal
Q21: The code length does not depend on
Q22: What is the advantage of superheterodyning?<br>A)high selectivity
Q23: Which achieves greater compression?<br>A)lossless coding<br>B)lossy coding<br>C)lossless &
Q24: Which bit is reserved as a parity
Q26: Equivocation is the<br>A)conditional entropy<br>B)joint entropy<br>C)individual entropy<br>D)none of
Q27: Notch is a_ <br>A)high pass filter<br>B)low pass filter<br>C)band
Q28: Mutual information should be<br>A)positive<br>B)negative<br>C)positive & negative<br>D)none of
Q29: Sin wave is_ <br>A)aperiodic signal<br>B)periodic signal<br>C)random signal<br>D)deterministic signal
Q30: Lempel-Ziv algorithm is<br>A)variable to fixed length algorithm<br>B)fixed