Practice Ambiguity In Morse Code (21.3) - Greedy Algorithms: Huffman Codes

Practise this section

9 questions

Flashcard drill
3 cards from this section. Quick, good the night before a test.
Exercise
6 questions · about 4 min · pass mark 70%. Hints available.
Sign up to start the exercise
Quiz
3 questions · about 2 min · pass mark 70%. Hints available.
Sign up to start the quiz

6 sample questions

Question 1.
What is Morse Code?
Show hintHide hint
Think about signal representation.
Question 2.
Why is Morse code considered ambiguous?
Show hintHide hint
Think of the sequence '01'.
3Question 3.
What does Morse code represent?
- Numbers only
- Characters only
- Both numbers and characters
Show hintHide hint
Consider what Morse initially encoded.
4Question 4.
True or False: The prefix code allows one code to be a prefix of another.
- True
- False
Show hintHide hint
Think back to the definition of prefix codes.
Question 5.
If the letters E, T, A, O, N are to be encoded with frequencies E=0.12, T=0.09, A=0.08, O=0.07, and N=0.06, derive optimal Huffman codes for them.
Show hintHide hint
Construct the tree using the least frequent letters first.
Question 6.
If Morse code were to include a new symbol 'S' represented by '--', how would this affect the current codes for E, T, and A if we start decoding from the beginning?
Show hintHide hint
Think of how the new code interacts with existing symbols.

5 more questions in this section. Enroll free to practise them all.