Write a python program. That does the following: 1. prompts the user to guess a letter in a hard-coded word 2. validates the input 3. adds the letter to a two-dimensional array that stores the guessed letter (string) and the number of times that letter has been guessed (int). If the letter is already in the list, then the list should be updated accordingly (i.e., no duplicate letters in the list!) The list will follow this format: [[guessed letter1, number of guesses], [guessed letter2, number of guesses], ...] Example: [[“a”, 3], [“e”, 2], [“c”, 1]] Hint: this will require iterating over the list, remember that the character is always in position [x][0] 4. check if the character is in the word 5. outputs if the character is in the word and the number of times this character has been guessed 6. the program should continue to prompt the user until they enter ‘quit’   Example: # the word is kookaburra Enter a letter: a The letter ‘a’ is in the word Number of times guessed the letter ‘a’: 1 Enter a letter: a The letter ‘a’ is in the word Number of times guessed the letter ‘a’: 2 Enter a letter: c The letter ‘c’ is not in the word Number of times guessed the letter ‘c’: 1 Enter a letter: quit The word was kookaburra Goodbye

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

Write a python program. That does the following:
1. prompts the user to guess a letter in a hard-coded word
2. validates the input
3. adds the letter to a two-dimensional array that stores the guessed letter (string) and the number of times that letter has been guessed (int). If the letter is already in the list, then the list should be updated accordingly (i.e., no duplicate letters in the list!)
The list will follow this format:
[[guessed letter1, number of guesses], [guessed letter2, number of guesses], ...]
Example:
[[“a”, 3], [“e”, 2], [“c”, 1]]
Hint: this will require iterating over the list, remember that the character is always in position [x][0]
4. check if the character is in the word
5. outputs if the character is in the word and the number of times this character has been guessed
6. the program should continue to prompt the user until they enter ‘quit’

 

Example:
# the word is kookaburra
Enter a letter: a
The letter ‘a’ is in the word
Number of times guessed the letter ‘a’: 1
Enter a letter: a
The letter ‘a’ is in the word
Number of times guessed the letter ‘a’: 2
Enter a letter: c
The letter ‘c’ is not in the word
Number of times guessed the letter ‘c’: 1
Enter a letter: quit
The word was kookaburra
Goodbye

Expert Solution
steps

Step by step

Solved in 4 steps with 2 images

Blurred answer
Knowledge Booster
Arrays
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education