Commit 4c95fde2 authored by Danny Allen's avatar Danny Allen
Browse files

Adds instructions for running Zip.

parent bd5efc3a
......@@ -43,6 +43,10 @@ One of the applications of Tries is in solving Word Searches. A "word search" i
</pre><br>
## Zip ##
For this part of the write-up:
- You'll need a working SuffixTrie to run the ZIP experiments for this writeup. Implementing SuffixTrie yourself is part of the Above & Beyond section and not required for full credit. To use our provided SuffixTrie.jar (if you don't want to implement it yourself), right click on SuffixTrie.java in the Eclipse sidebar, choose Refactor > Rename, and name it something else (like SuffixTrieUnused.java) **with "update references" unchecked**. <br>
- Put your test files in the root directory of the project (that is, **at the same level as src**, not in the src folder).
### Running Zip ###
One of the classes in the main package is called Zip. This class uses your PriorityQueue to do Huffman coding, your FIFOQueue as a buffer, your stack to calculate the keyset of a trie (using recursive backtracking), and your SuffixTrie to do LZ77Compression. Find some text file (a free book from https://www.gutenberg.org/ or even the HTML of some website) and use Zip.java to zip it into a zip file. Then, use a standard zip utility on your machine (Finder on OS X, zip on Linux, WinZip or the like on Windows) to UNZIP your file. Check that you got back the original. Congratulations! Your program correctly implements the same compression algorithm you have been using for years! Discuss in a sentence or two how good the compression was and why you think it was good or bad. <pre>
**TODO**: Answer this question
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment