Description
The following workshop lets you practice basic java coding techniques, creating classes, methods, using arrays, Java I/O, inheritance, polymorphism, Exceptional Handling.
Task 1:
Write a program for hangman game that randomly picks a word from a text file named hangman.txt and prompts the user to guess one letter at a time, as shown in the sample run.
- Each letter in the word is displayed as an asterisk. When the user makes a correct guess, the actual letter is then displayed.
- When the user finishes a word, the following streps should happen o Display the number of misses to the user. o Ask the user to give you a new word, then add that word to your file txt. (Optional if you want to check for the duplicate words in the file)
o Ask the user whether to continue to play.
- If the user missed the same letter more than one time give extra hint to the player like “You’ve already tried this letter, try another letter”. Don’t count twice the same letter which is missed by the user.
- Have minimum 10 words of your choice in the file txt.
| (Guess) Enter a letter in word ******* > p
(Guess) Enter a letter in word p****** > r (Guess) Enter a letter in word pr**r** > p p is already in the word (Guess) Enter a letter in word pr**r** > o (Guess) Enter a letter in word pro*r** > g (Guess) Enter a letter in word progr** > d d is not in the word (Guess) Enter a letter in word progr** > m (Guess) Enter a letter in word progr*m > d You have already tried d, try a new letter |
| (Guess) Enter a letter in word progr*m > a
The word is program. You missed 1 time Enter a new word to be added in the memory> apple Do you want to guess another word? Enter y or n> |
Note: Students can make the output better as well in easier and more readable format.
Task – 2
Write a program that prompts the user to enter a file name and displays the occurrences of each letter in the file. Letters are case-sensitive. Here is a sample run:
| Enter a filename: Somefile.txt
Number of A’s: 56 Number of a’s: 24 Number of B’s: 134 … Number of Z’s: 9 Number of z’s: 2 |
