Data Structures Homework for Week 6.
This homework is in preparation for quiz
#3.
1. Suppose you are given a
text consisting of the characters {A,B,C,D,E,F} with probabilities A= 0.05, B =
0.05, C = 0.10, D = 0.25, E = 0.30, and F = 0.25. Draw a Hufman tree
corresponding to these characters and specify the code obtained for each
character.
2. Draw a heap with
keys values taken from the probabilities in the previous question.
All questions below are taken
from Adam Drozdek Data
structures and algorithms in C++,
Course Technology 2005 (3rd
ed.).
Ex.
11.6
Questions
1,2,4.
Ex.
6.12
Question
24.
Posted: Wed - February 7, 2007 at 12:55 PM