Write a program called p2.py (python) 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
Write a program called p2.py (python) 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
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...
Related questions
Question
Write a program called
p2.py (python)
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
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
Recommended textbooks for you
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
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 Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
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
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY