Assignment 2 (Due at 1030 a.m on Friday of Week 10).ppt

Hash Tables Dictionaries Assignment 2: (Due at 10:30 a.m on Friday of Week 10) Review of Lecture 1 to Lecture 6 Lecture 2: Lecture 4: Tree Lecture 5: More on Trees Lecture 6: Priority Queue (Heeps) Lecture 6: Priority Queue (Heeps) Huffman codes (Page 565 Chapter 12.4) Binary character code: each character is represented by a unique binary string. A data file can be coded in two ways: Variable-length code Need some care to read the code. 001011101 (codeword: a=0, b=00, c=01, d=11.) Where to cut? 00 can be explained as either aa or b. Prefix of 0011: 0, 00, 001, and 0011. Prefix codes: no codeword is a prefix of some other codeword. (prefix free) Prefix codes are simple to encode and decode. Using codeword in Table to encode and decode Encode: abc = 0.101.100 = 0101100 (just concatenate the codewords.) Decode: 001011101 = 0.0.101.1101 = aabe Encode: abc = 0.101.100 = 0101100 (just concatenate the codewords.) Decode: 001011101 = 0.0.101.1101 = aabe (use the (right)binary tree below:) Binary tree Every nonleaf node has two children. The fixed-length code in our example is not optimal. The total number of bits required to encode a file is f ( c ) : the frequency (number of occurrences) of c in the file dT(c): denote the depth of c’s leaf in the tree Constructing an optimal code Formal definition of the problem: Input: a set of characters C={c1, c2, …, cn}, each c?C has frequency f[c]. Output: a binary tree representing codewords so that the total number of bits required for the file is minimized. Huffman proposed a greedy algorithm to solve the problem. The Huffman Algorithm This algorithm builds the tree T corresponding to the optimal code in a bottom-up manner. C is a set of n characters, and each character c in C is a character with a defined frequency f[c]. Q is a priority queue, keyed on f, used to identify the two least-frequent characters to merge together. The result of the merger is a new object (internal node) whose frequency is the sum o