Data Structure and Algorithm Complexity Assignment - Open University of Mauritius

Assignment Task

Question

Test the average theoretical compression ratio of the Greedy compression algorithm: Huffman Coding.

In particular, we want to measure the compression ratio of several text scenarios.

In order to verify these, you should perform the following:

1. Create a program Huffman that converts text to compressed text.

2. Collect data about the average compression ratio of different text with small and large number of characters, text with small and large repetition of characters.

3. Give a conclusion.

This IT Computer Science has been solved by our PhD Experts at My Uni Papers.