
Concept explainers
Problem D. Durdle Game
Using the function from the previous problem, write a function durdle_game(target) which takes in as an argument a single string that will be the target to guess, and lets the user attempt to guess the target word. Each time the user makes a guess, the function will print out the result of the previous function to tell the user how close they are. If the user guesses correctly, then the game is over. Have the function return the number of guesses that it took the user to get the correct answer.
Examples (text in bold is returned, text in red is user input.):
>>> durdle_game('trick')
Welcome to Durdle!
Enter a guess:touch
GBBGB
Enter a guess:trash
GGBBB
Enter a guess:truck
GGBGG
Enter a guess:trick
GGGGG
Congratulations, you got it in 4 guesses!
4
>>> durdle_game('stoop')
Welcome to Durdle!
Enter a guess:chart
BBBBY
Enter a guess:tones
YYBBY
Enter a guess:togas
YYBBY
Enter a guess:tofus
YYBBY
Enter a guess:stock
GGGBB
Enter a guess:stops
GGGYY
Enter a guess:stoop
GGGGG
Congratulations, you got it in 7 guesses!
7

Trending nowThis is a popular solution!
Step by stepSolved in 2 steps with 1 images

- Launch Meeting - Zoc X S Launch Meeting Zoc X Is Everyone Really Equ x E Reading Response 6 OCh7: Oppression & Se x SThank you for downlc X s.ucsc.edu/courses/46018/assignments/294537 2. are_anagrams This function takes two strings and returns True if they are anagrams of one another, which is to say that they contain the same letters, possibly rearranged, ignoring spaces and case. You can assume that the two input strings contain only letters and spaces. Sample calls should look like this: >>> are_anagrams ("bimmy is my friend", "My Bird Fey Minims") True >>> are_anagrams ("bimmy is my friend", "hello everyone") False >>> are_anagrams ("internet anagram server", "I rearrangement servant") True >>> are_anagrams ("internet anagram server", "internet anagram server") True 3. find_movies_by_director 4:11 PM This function takes a list of tuples (representing movies) and a string (representing a name of a director) and returns a 65°F Sunny 11/2/2021 e searcharrow_forwardThis is for my C++ 2 class, so still a beginner C++ program: Case Manipulator Write a program with three functions: upper, lower, and flip. The upper function should accept a C-string as an argument. It should step through all the characters in the string, converting each to uppercase. The lower function, too, should accept a pointer to a C-string as an argument. It should step through all the characters in the string, converting each to lowercase. Like upper and lower, flip should also accept a C-string. As it steps through the string, it should test each character to determine whether it is upper- or lowercase. If a character is uppercase, it should be converted to lowercase. If a character is lowercase, it should be converted to uppercase. Test the functions by asking for a string in function main, then passing it to them in the following order: flip, lower, and upper.arrow_forward1. What does the following code segment return assuming the argment passed is a single word or short phrase def mystery3(word: str) -> str:output = ""for char in word:output = char + outputreturn output 2. Write a function called removeVowels that accepts a string as a parameter and return a copy of that string with no vowels (aeiou) in it. Upper case and lower case vowels will be remove and the rest of the string is not changed. For example removeVowels("The Quick Brown Fox) would return "Th Qck Brwn Fx"arrow_forward
- Codingarrow_forwardUsing C++ write this code Write a function called isValidNote that accepts a string and returns true if that string is a valid note expressed in SPN and false otherwise. See the explanation above for clarity on what is and is not considered valid SPN. Function Specifications: Name: isValidNote() Parameters (Your function should accept these parameters IN THIS ORDER): note (string): The string to be checked Return Value: True or false (bool) The function should return true if the string is a valid note in SPN and false otherwise. The function should not print anything. The function should be case-sensitive, e.g. B0 is valid SPN but b0 is not. Hint: Any note expressed in valid SPN will be exactly 2 characters long. --- Examples --- Sample function call Expected return value isValidNote("y") False isValidNote("D4") True isValidNote("d4") False isValidNote("E72") False isValidNote("I love coding") False Your file should be named isValidNote.cpp and should also…arrow_forwardC++arrow_forward
- Ex. 8.4) The following functions are all intended to check whether a string contains any lowercase letters, but at least some of them are wrong. For each function, describe what the function actually does (assuming that the parameter is a string).arrow_forwardFor each function, describe what it actually does when called with a string argument. If it does not correctly check for lowercase letters, give an example argument that produces incorrect results, and describe why the result is incorrect. # 1 def any_lowercase1(s): for c in s: if c.islower(): return True else: return False # 2 def any_lowercase2(s): for c in s: if 'c'.islower(): return 'True' else: return 'False' # 3 def any_lowercase3(s): for c in s: flag = c.islower() return flag # 4 def any_lowercase4(s): flag = False for c in s: flag = flag or c.islower() return flag # 5 def any_lowercase5(s): for c in s: if not c.islower(): return False return True The code and its output must be explained technically whenever asked. The explanation can be provided before or after the code, or in the form of code comments within…arrow_forwardProbelm part 1: Define a function called common_divisors that takes two positive integers m and n as its arguments and returns the list of all common divisors (including 1) of the two integers, unless 1 is the only common divisor. If 1 is the only common divisor, the function should print a statement indicating the two numbers are relatively prime. Otherwise, the function prints the number of common divisors and the list of common divisors. Complete each to do with comments to expalin your process. Problem part 2: complete the following todo's and make comments to explain each step # TODO: Define the function 'common_divisors' with two arguments 'm' and 'n'. # TODO: Start with an empty list and append common divisors to the list. # TODO: Create a conditional statement to print the appropriate statement as indicated above. Problem part 3: Call the function common_divisors by passing 5 and 38. Your output should look like this: 5 and 38 are relatively prime. # TODO: Call…arrow_forward
- 4. Complete the function show_upper. This function takes one parameter - a string (s). It should return a string made up of all the upper-case characters in s. For example, if s is “aBdDEfgHijK” then show_upper should return “BDEHK”. It should return the upper-case string - not print it. Do not change anything outside show_upper.arrow_forwardin c programing with User-Defined Functions Remove all non-alphabetic characters Write a program that removes all non-alphabetic characters from the given input. Assume the input string will not exceed 50 characters. Ex: If the input is: -Hello, 1 world$! the output is: Helloworld The program must define and call a function named RemoveNonAlpha that takes two strings as parameters: userString and userStringAlphaOnly. userString is the user specified string from the program input. Function RemoveNonAlpha() then assigns userStringAlphaOnly with the user specified string without any non-alphabetic characters.void RemoveNonAlpha(char userString[], char userStringAlphaOnly[])arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





