One of the main assignments for this course is to write
compression and uncompression algorithms
to compress
a sparse file containing N=10000 bits of which roughly 0.01 are 1s;
your algorithm should work well on all such files.
Please email to djcm1 the compressed size that your algorithm achieves,
and maybe write a brief webpage summarising your method.
If you'd like to use the Huffman algorithm in constructing your
solution, here's one in perl.
[Worked solutions: C programs for compression]