Huffman Code MCQ

Test your knowledge with important Huffman Code MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Huffman Code MCQs at Bissoy

• What is the running time of the Huffman algorithm, if its implementation of the priority queue is done using linked lists?
  ক

  O(C)

  খ

  O(log C)

  গ

  O(C log C)

  ঘ

  O(C2)
• What is the running time of the Huffman encoding algorithm?
  ক

  O(C)

  খ

  O(log C)

  গ

  O(C log C)

  ঘ

  O( N log C)
• The type of encoding where no character code is the prefix of another character code is called?
  ক

  optimal encoding

  খ

  prefix encoding

  গ

  frequency encoding

  ঘ

  trie encoding
• An optimal code will always be present in a full tree.
  ক

  true

  খ

  false
• What will be the cost of the code if character ci is at depth di and occurs at frequency fi?
  ক

  cifi

  খ

  ∫cifi

  গ

  ∑fidi

  ঘ

  fidi
• From the following given tree, what is the computed codeword for ‘c’?
  ক

  111

  খ

  101

  গ

  110

  ঘ

  011
• From the following given tree, what is the code word for the character ‘a’?
  ক

  011

  খ

  010

  গ

  100

  ঘ

  101
• In Huffman coding, data in a tree always occur?
  ক

  roots

  খ

  leaves

  গ

  left sub trees

  ঘ

  right sub trees
• The code length does not depend on the frequency of occurrence of characters.
  ক

  true

  খ

  false
• How many bits are needed for standard encoding if the size of the character set is X?
  ক

  log X

  খ

  X+1

  গ

  2X

  ঘ

  X2
• Which bit is reserved as a parity bit in an ASCII set?
  ক

  first

  খ

  seventh

  গ

  eighth

  ঘ

  tenth
• How many printable characters does the ASCII character set consists of?
  ক

  120

  খ

  128

  গ

  100

  ঘ

  98