Description: Your program will generate the Huffman encoding for a given text file and output the character frequency and the encoded binary string. Additionally, output the size of the original text as well as the encoded string in bytes.
You will need a few different components to get this working: a priority queue, a frequency table, and the Huffman Tree itself.
Design first. Then code.
Make sure each individual part works before putting them together. (Test your code!)
Feel free to rely on your text for help, but implement your own data structures
Helping each other is fine, but collaborate on ideas, not code
Consider a different type of node for the leaves
Huff Tree building in short:
Create n HuffTrees, each with a single letter
Enqueue all HuffTrees
Dequeue twice, combining and re-enqueuing the result
Repeat until the queue is empty
Input: A text file from the command line. (i.e. java jar MyHuff.jar MyTextFile.txt).
Output: The binary encoding of the input file. Print out the encoding in text format. Print out the frequency table for each character. Output the size of the original text and the potential size of the output binary string.
Deliverables: All source code (important), YourProgram.jar, readme.txt, Post-Mortem, Documentation
It is not our intention to break the school's academic policy. Projects posted are only used as a reference
and should not be submitted as is. We are not held liable for any misuse of the solutions.
Please see the frequently asked questions page
for further questions and inquiries.
Kindly fill out the form.
Please provide a valid email address and we'll get back to you in less than 24 hours.
We will be sending an invoice through PayPal upon confirmation.
We are a non profit organization however we need an amount to keep this organization running,
and to be able to complete our research and development.