Quizalize logo
placeholder image to represent content

Huffman Coding

Quiz by GCSE Computer Science Teacher 2

GCSE (AQA)
Computer Science
English National Curriculum

Feel free to use or edit a copy

includes Teacher and Student dashboards

Track each student's skills and progress in your Mastery dashboards

With a free account, teachers can
  • edit the questions
  • save a copy for later
  • start a class game
  • automatically assign follow-up activities based on students’ scores
  • assign as homework
  • share a link with colleagues
  • print as a bubble sheet

Our brand new solo games combine with your quiz, on the same screen

Correct quiz answers unlock more play!

New Quizalize solo game modes
12 questions
Show answers
  • Q1
    What is Huffman coding?
    A compiler software
    A compression technique
    A programming language
    A searching algorithm
    30s
    3.3.8.b
  • Q2
    What is Huffman coding used for?
    To reduce the number of bits need to send or store a file
    To encrypt a file before it is sent over an email
    To duplicate a file before sending it
    To increase the number of bits need to send or store a file
    30s
    3.3.8.b
  • Q3
    How does the Huffman coding technique primarily work?
    Replaces all data with binary and then stores this
    Deleted unnecessary data items to reduce the file size
    Looks for frequently occurring data items
    Looks for the least frequent occurring data items
    30s
    3.3.8.b
  • Q4
    What is a benefit of using Huffman encoding?
    It is a lossless compression technique
    It is easy to implement and program
    It works equally well on all file types
    It is a lossy compression technique
    30s
    3.3.8.b
  • Q5
    What is the name given to understanding how many times a letter appears in a given language?
    Numerical Analysis
    Letter appearance
    Alphabet Analysis
    Letter frequency
    30s
    3.3.8.b
  • Q6
    What abstract data structure is used in a Huffman tree?
    A linked list
    A graph
    A binary tree
    A 2D array
    30s
    3.3.8.b
  • Q7
    What sits at the root of a Huffman tree representing a text document?
    The most used letter
    The least used letter
    The total characters in the document
    The number of words in the document
    30s
    3.3.8.b
  • Q8
    What name is given to the item that stores the information in the tree?
    Branch
    Edges
    Node
    Leaf
    30s
    3.3.8.b
  • Q9
    How many branches does each node have?
    3
    1
    4
    2
    30s
    3.3.8.b
  • Q10
    What nodes should be found at the bottom of the tree? (Furthest from the root)
    The last occurring data
    The least common data
    The most common data
    The first occurring data
    30s
    3.3.8.b
  • Q11
    How many times does the letter m appear in this encoded sentence?
    Question Image
    3
    4
    2
    1
    30s
    3.3.8.b
  • Q12
    What is the binary value for the letter R?
    Question Image
    11010
    11011
    11000
    10110
    60s
    3.3.8.b

Teachers give this quiz to your class