Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Word games are a fun way to test a player's general knowledge. Program a word game in which a player is given a category and has 3 opportunities to guess the correct answer that fits in the category. Each guess is compared to the correct answer, which is kept hidden from the player. The comparison is done using a metric called shortest edit distance, the number of insert/substitute/delete operations needed to change one word into another. Use dynamic programming to compute the shortest edit distance between two words of type String. After each guess, the score is updated with the distance. If the guess is incorrect, the distance from the correct answer is displayed to the player. If a guess is correct, or 3 incorrect answers have been given, move on to the next round. The game should take place over 10 rounds with categories and examples of your choosing. To win the game, a pointless (0) score is needed in each round. The final score must be written to a file called user.txt where user corresponds to the player alias/username. The following example uses a simple console interface and should guide your solution: Round 1: animal Answer 1: dog incorrect -> 4 Answer 2: monkey incorrect -> 3 Answer 3: mouse correct The correct answer for Round 1 is "mouse". The shortest edit distance between "mouse" and "dog" is 3. To transform "mouse" into "dog", the first and third letters need to be substituted ("m" replaced by "d" and "u" replaced with "g". Two letters ("s" and "e") need to be deleted. This gives a distance of 4. To transform "mouse" into "monkey", two substitutions and one insertion must be made. This gives a distance of 3.

Word games are a fun way to test a player's general knowledge. Program a word game in which a player is given a category and has 3 opportunities to guess the correct answer that fits in the category. Each guess is compared to the correct answer, which is kept hidden from the player. The comparison is done using a metric called shortest edit distance, the number of insert/substitute/delete operations needed to change one word into another. Use dynamic programming to compute the shortest edit distance between two words of type String. After each guess, the score is updated with the distance. If the guess is incorrect, the distance from the correct answer is displayed to the player. If a guess is correct, or 3 incorrect answers have been given, move on to the next round. The game should take place over 10 rounds with categories and examples of your choosing. To win the game, a pointless (0) score is needed in each round. The final score must be written to a file called user.txt where user corresponds to the player alias/username. The following example uses a simple console interface and should guide your solution: Round 1: animal Answer 1: dog incorrect -> 4 Answer 2: monkey incorrect -> 3 Answer 3: mouse correct The correct answer for Round 1 is "mouse". The shortest edit distance between "mouse" and "dog" is 3. To transform "mouse" into "dog", the first and third letters need to be substituted ("m" replaced by "d" and "u" replaced with "g". Two letters ("s" and "e") need to be deleted. This gives a distance of 4. To transform "mouse" into "monkey", two substitutions and one insertion must be made. This gives a distance of 3.

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Question 3 Word games are a fun way to test a player's general knowledge. Program a word game in which a player is given a category and has 3 opportunities to guess the correct answer that fits in the category. Each guess is compared to the correct answer, which is kept hidden from the player. The comparison is done using a metric called shortest edit distance, the number of insert/substitute/delete operations needed to change one word into another. Use dynamic programming to compute the shortest edit distance between two words of type String. After each guess, the score is updated with the distance. If the guess is incorrect, the distance from the correct answer is displayed to the player. If a guess is correct, or 3 incorrect answers have been given, move on to the next round. The game should take place over 10 rounds with categories and examples of your choosing. To win the game, a pointless (0) score is needed in each round. The final score must be written to a file called user.txt where user corresponds to the player alias/username. The following example uses a simple console interface and should guide your solution: Round 1: animal Answer 1: dog incorrect -> 4 Answer 2: monkey incorrect -> 3 Answer 3: mouse. correct The correct answer for Round 1 is "mouse". The shortest edit distance between "mouse" and "dog" is 3. To transform "mouse" into "dog", the first and third letters need to be substituted ("m" replaced by "d" and "u" replaced with "g". Two letters ("s" and "e") need to be deleted. This gives a distance of 4. To transform "mouse" into "monkey", two substitutions and one insertion must be made. This gives a distance of 3. Your driver program must be named Question3.java.
Transcribed Image Text:Question 3 Word games are a fun way to test a player's general knowledge. Program a word game in which a player is given a category and has 3 opportunities to guess the correct answer that fits in the category. Each guess is compared to the correct answer, which is kept hidden from the player. The comparison is done using a metric called shortest edit distance, the number of insert/substitute/delete operations needed to change one word into another. Use dynamic programming to compute the shortest edit distance between two words of type String. After each guess, the score is updated with the distance. If the guess is incorrect, the distance from the correct answer is displayed to the player. If a guess is correct, or 3 incorrect answers have been given, move on to the next round. The game should take place over 10 rounds with categories and examples of your choosing. To win the game, a pointless (0) score is needed in each round. The final score must be written to a file called user.txt where user corresponds to the player alias/username. The following example uses a simple console interface and should guide your solution: Round 1: animal Answer 1: dog incorrect -> 4 Answer 2: monkey incorrect -> 3 Answer 3: mouse. correct The correct answer for Round 1 is "mouse". The shortest edit distance between "mouse" and "dog" is 3. To transform "mouse" into "dog", the first and third letters need to be substituted ("m" replaced by "d" and "u" replaced with "g". Two letters ("s" and "e") need to be deleted. This gives a distance of 4. To transform "mouse" into "monkey", two substitutions and one insertion must be made. This gives a distance of 3. Your driver program must be named Question3.java.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS