![]() To simplify things in your implementation, you will only be reading and writing whole ASCII characters the entire time. Real Huffman encoding involves writing bit codes to the compressed file. You may NOT use the priority_queue class from the STL, but you may use other classes from the STL (i.e. ![]() You may use heap code from the slides (give said credit if you do so), or you may implement your own. You must use a heap (priority queue) data structure to receive full credit on this pre-lab. The lecture notes describe which characters are to be encoded. Your program should be case-sensitive (count upper-case and lower-case versions of the same letter as different characters). That is, your program should ignore newlines and tabs, but should not ignore spaces - thus, spaces need to be encoded, just like with other (printable) characters (note, however, that spaces are encoded differently see the input format for details). ![]() RequirementsĪssume that only printable ASCII characters will occur in the source (original, uncompressed) text file. Huffman compression and decompression are both covered in the Heaps and Huffman slide set.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |