Expected output continued

Grading (100 points)

Late Projects will not be accepted.

Turn in only your Java file! I do not need the text files.

Code Style (10 points)

Code style must match that of the book

Variable names should make sense

Whitespace should be consistent

Formatting should be consistent

Correctness (90 points)

Unique solution, no collaboration

Methods implemented correctly

Fields declared correctly

Correct output

All info is here

Assignment We want to create a program to solve cryptograms automatically, or at least try to. A cryptogram is a word puzzle where the letters have been changed via a "substitution cipher." For instance, all the A's may be K's. And all the B's may be G's. And so on. This encryption fails because you can count the frequency of the letters in the cipher and compare that to the frequency of the letters in english. Then create a "map" of the most common letters in the cipher to the most common letters in english. Just using that technique, you can get fairly close to solving it completely. However, the map may be off. So we also want to implement the ability to swap the map around how we please. Implementation 1. Read Charles Dickens Bleak House to calulate the letter frequency for english. (the program reads, nat you...) 2. Read the cipher text and generate the letter frequency for the cryptogram 3. Create a key of letters that is sorted from most frequent to least frequent for both the book and cipher frequencies 4. Create a map of the cipher characters to book characters in sorted order. 5. Decipher the text based off of the map created 6. Edit the map to reflect any small inaccuracies encountered Assignment We want to create a program to solve cryptograms automatically, or at least try to. A cryptogram is a word puzzle where the letters have been changed via a "substitution cipher." For instance, all the A's may be K's. And all the B's may be G's. And so on. This encryption fails because you can count the frequency of the letters in the cipher and compare that to the frequency of the letters in english. Then create a "map" of the most common letters in the cipher to the most common letters in english. Just using that technique, you can get fairly close to solving it completely. However, the map may be off. So we also want to implement the ability to swap the map around how we please. Implementation 1. Read Charles Dickens Bleak House to calulate the letter frequency for english. (the program reads, nat you...) 2. Read the cipher text and generate the letter frequency for the cryptogram 3. Create a key of letters that is sorted from most frequent to least frequent for both the book and cipher frequencies 4. Create a map of the cipher characters to book characters in sorted order. 5. Decipher the text based off of the map created 6. Edit the map to reflect any small inaccuracies encountered