DC MCQ Unit-02

Unit-II
1. Huffman codes are codes and are optimum for a given model (set of
probabilities).
A. Parity
B. Prefix
C. Convolutional code
D. Block code
Correct option is B
2. The Huffman procedure is based on observations regarding optimum

prefix codes, which is/are
A. In an optimum code, symbols that occur more frequently (have a
higher probability of occurrence) will have shorter codewords than
symbols that occur less
B. In an optimum code, the two symbols that occur least frequently will have
the same length
C. Both (A) and (B)
D. None of these
Correct option is C
3. The best algorithms for solving Huffman codes

A. Brute force algorithm
B. Divide and conquer algorithm
C. Greedy algorithm
D. Exhaustive search
Correct option is C
4. How many printable characters does the ASCII character set consists of?
A. 128
B. 100
C. 98
D. 90
Correct option is B
5. The difference between the entropy and the average length of the
Huffman code is called
A. Rate
B. Redundancy
C. Power
D. None of these
Correct option is B
6. Unit of redundancy is
A. bits/second
B. symbol/bits
C. bits/symbol
D. none of these
Correct option is C
7. The redundancy is zero when

A. The probabilities are positive powers of two
B. The probabilities are negative powers of two
C. Both
D. None of the above
Correct option is B
8. Which bit is reserved as a parity bit in an ASCII set?

A. Sixth
B. Seventh
C. Eighth
D. Ninth
Correct option is C
9. Bits are needed for standard encoding if the size of the character set is X
A. X+1
B. log(X)
C. X2
D. 2X
Correct option is B
10. In Huffman coding, data in a tree always occur in
A. Leaves
B. Roots
C. Left sub trees
D. None of these
Correct option is A
11. An optimal code will always be present in a full tree?
A. True
B. False
Correct option is A
12. Running time of the Huffman encoding algorithm is

A. O(Nlog(C))
B. O(Clog(C))
C. O(C)
D. O(log(C)) Answer
Correct option is B
13. Running time of the Huffman algorithm, if its implementation of the

priority queue is done using linked lists
A. O(log(C))
B. O(Clog(C))
C. O(C2)
D. O(C)
Correct option is C
14. The unary code for a positive integer n is simply n followed by

a .
A. zero, ones
B. ones, zero
C. None of these
Correct option is B
15. The unary code for 4 is .

A. 11100
B. 11110
C. 00001
D. 00011
Correct option is B
16. In the Tunstall code, all codewords are of However, each codeword
represents a number of letters.
A. different, equal
B. equal, different
C. none of these
Correct option is B
17. Tunstall coding is a form of entropy coding used for

A. Lossless data compression
B. Lossy data compression
C. Both
D. None of these
Correct option is A
18. The main advantage of a Tunstall code is that

A. Errors in codewords do not propagate
B. Errors in codewords propagate
C. The disparity between frequencies
D. None of these
Correct option is A
19. Applications of Huffman Coding

A. Text compression
B. Audio compression
C. Lossless image compression
D. All of the above
Correct option is D
20. An alphabet consist of the letters A, B, C and D. The probability of

occurrence is P(A) = 0.4, P(B)= 0.1, P(C) = 0.2 and P(D) = 0.3. The Huffman
code is
A. A = 0 B = 111 C = 110 D = 10
B. A = 0 B = 11 C = 10 D = 111
C. A = 0 B = 111 C = 11 D = 101
D. A = 01 B = 111 C = 110 D = 10
Correct option is A
21. The basic idea behind Huffman coding is to

A. compress data by using fewer bits to encode fewer frequently
occuring characters
B. compress data by using fewer bits to encode more frequently
occuring characters
C. compress data by using more bits to encode more frequently
occuring characters
D. expand data by using fewer bits to encode more frequently
occuring characters
Correct option is B
22. Huffman coding is an encoding algorithm used for

A. lossless data compression
B. broadband systems
C. files greater than 1 Mbit
D. lossy data compression
Correct option is A
23. A Huffman encoder takes a set of characters with fixed length and
produces a set of characters of
A. random length
B. fixed length
C. variable length
D. constant length
Correct option is C
24. A Huffman code: A = 1, B = 000, C = 001, D = 01 , P(A) = 0.4, P(B) = 0.1,

P(C) = 0.2, P(D) = 0.3 The average number of bits per letter is
A. 0 bit
B. 1 bit
C. 0 bit
D. 9 bit
Correct option is C
25. Which of the following is not a part of the channel coding?

A. rectangular code
B. Checksum checking
C. Hamming code
D. Huffman code
Correct option is D
26. Which of the following is the first phase of JPEG?

A. DCT Transformation
B. Quantization
C. Data Compression
D. None of the above
Correct option is D
27. Which type of method is used is used to compress data made up of

combination of symbols?
A. Run- length encoding
B. Huffman encoding
C. Lempel Ziv encoding
D. JPEG encoding
Correct option is A
28. How many passes does lossy compression makes frequently?

A. One pass
B. Two pass
C. Three pass
D. Four pass
Correct option is B
29. Information is the

A. data
B. meaningful data
C. raw data
D. Both A and B
Correct option is B

DC MCQ Unit-02

Uploaded by

Copyright:

Available Formats

DC MCQ Unit-02

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DC MCQ Unit-02

Uploaded by

Copyright:

Available Formats

Unit-II

2. The Huffman procedure is based on observations regarding optimum

3. The best algorithms for solving Huffman codes

7. The redundancy is zero when

8. Which bit is reserved as a parity bit in an ASCII set?

10. In Huffman coding, data in a tree always occur in

11. An optimal code will always be present in a full tree?

12. Running time of the Huffman encoding algorithm is

13. Running time of the Huffman algorithm, if its implementation of the

14. The unary code for a positive integer n is simply n followed by

15. The unary code for 4 is .

17. Tunstall coding is a form of entropy coding used for

18. The main advantage of a Tunstall code is that

19. Applications of Huffman Coding

20. An alphabet consist of the letters A, B, C and D. The probability of

21. The basic idea behind Huffman coding is to

22. Huffman coding is an encoding algorithm used for

24. A Huffman code: A = 1, B = 000, C = 001, D = 01 , P(A) = 0.4, P(B) = 0.1,

25. Which of the following is not a part of the channel coding?

26. Which of the following is the first phase of JPEG?

27. Which type of method is used is used to compress data made up of

28. How many passes does lossy compression makes frequently?

29. Information is the

You might also like