CSE 143: Computer Programming II, Summer 2017

• Specification (PDF)

• HuffmanCompressor.java, the main program that lets you encode/decode files
• BitInputStream.java, for reading input one bit at a time
• BitOutputStream.java, for writing output one bit at a time
• Test case input files:

  Input file	Compressed	Compressed Bytes
  tiny.txt	tiny.short tiny.code	tiny.bytes
  taxi.txt	taxi.taxi taxi.code	taxi.bytes
  simple.txt	simple.simple simple.code	simple.bytes
  hamlet.txt	hamlet.short hamlet.code	hamlet.bytes

  The last column has the debug output of the compressed file when you say "y" to debugging

  WARNING: Do not copy and paste the contents of the txt files, you will run into weird bugs. Right click and press "Save As" to download the file

  a7.zip (all of the above)

• (You can verify the output using the Output Comparison Tool)

Remember that in jGRASP you can use a structure viewer to see what your tree looks like. You do so by dragging one of your fields from the debug window outside the window and jGRASP will launch a viewer. This viewer will show you the structure of the tree, but may not show you the contents of the nodes. You can fix this by selecting the wrench icon ("Configure the structure to view mapping"). Under "Value Expressions" say:

_node_.<field>

Where "<field>" is the name of the field you want to view. You can also say:

_node_.<field1>#_node_.<field2>

• tree for tiny.txt
• tree for simple.txt
• tree for hamlet.txt

• Java API: PriorityQueue, Comparable, InputStream, OutputStream
• YouTube video about Huffman coding theory
• Wikipedia: Huffman coding

• Frequently Asked Questions
• Message Board

• Specification (PDF)

• QuestionsGame.java, starter code for your class
• QuestionsMain.java, a text user interface to play the game
• spec-questions.txt | big-questions.txt input files of question data
• a6.zip contains all files listed above
  (You can verify the output using the Output Comparison Tool)

Remember that in jGRASP you can use a structure viewer to see what your tree looks like. You do so by dragging one of your fields from the debug window outside the window and jGRASP will launch a viewer. This viewer will show you the structure of the tree, but may not show you the contents of the nodes. You can fix this by selecting the wrench icon ("Configure the structure to view mapping"). Under "Value Expressions" say:

_node_.<field>

Where "<field>" is the name of the field you want to view. You can also say:

_node_.<field1>#_node_.<field2>

• Java API Specification: PrintStream, Scanner
• AnimalGame.com - Play a "20 Questions" game online that guesses any animal!
• Akinator, The Web Genius - another "20 Questions" game with an all-knowing genie

• Frequently Asked Questions
• Message Board

• Specification (PDF)

• LetterInventory.class, a class to help you count, add, and subtract letters from words and phrases
• LetterInventory.jar, JAR archive version for Eclipse
  • For those using Eclipse, you should include LetterInventory.jar in your project. To add the JAR file to your project, select your project, go to the Projects menu and select Properties, then Java Build Path, then Libraries, then click Add External JARs. When you add LetterInventory.jar to the build path, it should work.
  • For those using jGRASP or another basic editor, just put LetterInventory.class in the same folder as your program.

    Sometimes this program produces a lot of output. If you run it in jGRASP, it will display just 500 lines of output. In Windows, If you want to see more, go to the Build menu and select the Run in MSDOS Window option. Then when the window pops up, right-click on the title bar of the window, select Properties, and under the Layout tab you should be able to adjust the Screen Buffer Size Height to something higher (like 9999 lines).

• AnagramMain.java, an interactive test program that lets you generate anagrams
• small.txt | eleven.txt | dict1.txt (short) | dict2.txt (medium) | dict3.txt (long) | dict4.txt (long, alternate order)
  (You can verify the output using the Output Comparison Tool)

• sample trace using dictionary (bee, go, gush, shrug)
• corresponding decision tree (click to enlarge)

• Internet Anagram Server, a cool web site that generates anagrams

• Frequently Asked Questions
• Message Board

• Specification (PDF)

• GrammarMain.java, an interactive test program that lets you generate output
• simple.txt | sentence.txt | sentence2.txt | math.txt, input files read by GrammarMain.
• You can verify the output using the Output Comparison Tool
• Here is the zip of the provided files (a4.zip)

• HW4 Grammar Verifier, a web page that lets you paste your sentences and math expressions from your grammar to see if they match the proper format
• Recursion.java, a helper class with a method Recursion.println that lets you print nicely indented output from recursive calls
• TestExpression.java, a short testing program that lets you paste in an expression generated from math.txt and see whether it compiles

• Java API Specification: Map, Random, String
• Wikipedia: Formal grammar, Formal language, Backus-Naur Form (BNF), John Backus, Peter Naur
• The grammar for Java programs

• Frequently Asked Questions
• Message Board

• Specification (PDF)

• AssassinNode.java

• AssassinMain.java

names.txt

names1.txt

names2.txt

names3.txt

or you can download all the files with a3.zip

• Wikipedia: Assassin (game)

• Frequently Asked Questions
• Message Board

• Specification (PDF)

• ArrayIntList.java
• ArrayIntListTest.java

• Specification (PDF)

• HTMLMain.java
• HTMLParser.java
• HTMLTag.java
• HTMLTagType.java
• a2.zip (All Required Files and Test Programs in a zip. In Eclipse, put .java files in your src folder and .html files in your top-level project folder)

• HtmlValidatorTest.java, a starter file for your tests.
• test1.html, test2.html,
  test3.html, test4.html,
  test5.html, test6.html,
  test7.html

  (You can right-click any of the above HTML files to copy its URL or save it to your hard drive;
  you should also verify these test*.html outputs using the Output Comparison Tool)

• Java API Specification: Stack
• Java API Specification: Queue
• W3Schools HTML Tutorial (optional)
• Wikipedia: HTML (optional)

• Frequently Asked Questions
• Message Board

• Specification (PDF)

• FrequencyAnalysis.java
• cryptogram.txt
• dictionary.txt

The following programs can be used in place of the Output Comparison Tool.

Future weeks won't have provided tests and you should use the Output Comparison Tool instead as well as write your own tests

• Test1.java and test1.txt
Test2.java and test2.txt
• Test3.java and test3.txt

or you can download all the files with a1.zip

• Message Board (Please do not post solution code! Read agreement here.)
• Using Eclipse between computers