I. 276. Huffman coding is an algorithm to compress data. You should get familiar with the algorithm to some extent and make a presentation about it. By using the string ``INFORMATIKA + MATEMATIKA'', demonstrate the steps of creating the code. Your presentation should be as clear as possible, show each step of the encoding process, and should contain an animation in the case, e.g., of creating and visiting the tree. Create action buttons to switch between slides and start the animation.
The file containing your presentation (i276.pptx, i276.odp,. . . ) should be submitted in a compressed file i276.zip.
Deadline expired on 10 November 2011.