Write a higher order function called store_word that takes in a secret word. It will return the length of the secret word and another function, guess_word, that the user can use to try to guess the secret word. Assume that when the user tries to guess the secret word, they will only guess words that are equal in length to the secret word. The user can pass their guess into the guess_word function, and it will return a list where every element in the list is a boolean, True or False, indicating whether the letter at that index matches the letter in the secret word! def store_word (secret): www >>> word_len, guess_word = store_word ("cake") >>> word_len 4 >>> guess_word("corn") [True, False, False, False] >>> guess word("come") [True, False, False, True] >>> guess word ("cake") [True, True, True, True] >>> word_len, guess_word = store_word ("pop") >>> word_len 3 >>> guess_word("ate") [False, False, False] >>> guess_word("top") [False, True, True] >>> guess word ("pop") [True, True, True] "**** YOUR CODE HERE *****"

Write a higher order function called store_word that takes in a secret word. It will return the length of the secret word and another function, guess_word, that the user can use to try to guess the secret word. Assume that when the user tries to guess the secret word, they will only guess words that are equal in length to the secret word. The user can pass their guess into the guess_word function, and it will return a list where every element in the list is a boolean, True or False, indicating whether the letter at that index matches the letter in the secret word! def store_word (secret): www >>> word_len, guess_word = store_word ("cake") >>> word_len 4 >>> guess_word("corn") [True, False, False, False] >>> guess word("come") [True, False, False, True] >>> guess word ("cake") [True, True, True, True] >>> word_len, guess_word = store_word ("pop") >>> word_len 3 >>> guess_word("ate") [False, False, False] >>> guess_word("top") [False, True, True] >>> guess word ("pop") [True, True, True] " YOUR CODE HERE *"

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 18PE

See similar textbooks

Similar questions

Write a function MedianWithoutHL(ScoreList) that takes an unsorted list of n numbers as a parameter, discards the highest and the lowest numbers and return the median. You can assume the number of items in the list is between 0.0 and 9.9. To find the median from a list of items, you have tosort the list and find out the value of the item in the middle.Note: If the list has an odd number of items, the median is the value of the middle item. If the list has an even number of items, the median is the average of the two middle items.Sample Run #1:scoreList1 = [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]print("The Original ScoreList: ", scoreList1)print(MedianWithoutHL(scoreList1))Output of Sample Run #1:The Original ScoreList: [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]The List after sorting: [5.0, 6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0, 9.5]Without the High & Low: [6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0]7.75
Write in C++ Now, what if Sam wants to insert Eevee after Pikachu but he doesn't know where Pikachu is located in his list. Let's help him search for a Pokemon by its name and insert another Pokemon directly after it. Write a function secondPlace() that takes six parameters and inserts a new Pokemon into a list right after another specified pokemon. Once you find the specified Pokemon, use the insertAfter() function from the previous sub-question to add the new Pokemon. The function should return the new number of strings in the array. Note The same Pokemon may appear in the list multiple times (Sam has a bad memory). Assume that Sam wants every instance of the Pokemon he is searching for to be followed by the Pokemon he is attempting to insert. If the array is already full or if the number of strings that are going to be added to the array plus the current number of strings exceeds the total size of the array, the array should remain unchanged. Assume all inputs are lowercase…
Write a function named how_many(a_list, a_num) that that expects a list of numbersand a number as arguments. It returns how many times the number is found in the list.If the number is not in the list, return 0. For examplehow_many( [12, 15, 16, 4, 10, 3, 5, 7, 9, 15], 15 )returns 2 And how_many( [12, 15, 16, 4, 10, 3, 5, 7, 9, 15], 11 )returns 0Ask the user for an integer between 0 and 19. If the number is in the list, report howmany times it occurs.
Write a function called remove_odd that takes a list of numbers that have both even and odd numbers mixed.# Function should remove all the odd numbers and return a compact list which only contains the even numbers. Example1: Function Call:remove_odd ([21, 33, 44, 66, 11, 1, 88, 45, 10, 9])Output:[44, 66, 88, 10]
Write a function that takes two arguments: stock and ingr (short for ingredients) and returns the missing ingredients in stock. stock is a dictionary containing (key,value) pairs in the form of ("potato", 5).The key is the name of an ingredient, and the vlaue is its existingamount. ingr is a list of tuples, where each tuple represents the requiredamount of an ingredient. For example, ("cheese", 3) means we need 3 units of cheese for this recipe. Your function checks whether we have enough of each itemin the stock. If an item is missing or not enough then your function returns the missing amount within a list of all such items. If all items are in stock, then you return an empty list. For example: stock = {"salt":100, "sugar":100, "flour":50, "apple":3, "cream":10}ingr = [("sugar",50), ("flour", 120), ("apple",5)] checkStock(stock, ingr) should return [("flour",70), ("apple",2)] which means we need 70 more units of flour and 2 more apples for this recipe.Note that it is possible for an…
Write a function that will accept a list of numbers and an integer (n). Thefunction should return a list containing every nth item from the input list,always starting with the first item in the list. The original list should notbe modified.For example, if the function is passed the list[8, 3, 19, 26, 32, 12, 3, 7, 21, 16]and the integer 3, it will return the list[8, 26, 3, 16]The function should be general, and work for any list and any positiveinteger value of n.def countByN(myList,n):return myList[::n]
4. Modify the bracketsBalance function so that the caller can supply the brackets to match as arguments to this function. The second argument should be a list of beginning brackets, and the third argument should be a list of ending brackets. The pairs of brackets at each position in the two lists should match; that is, position 0 in the two lists might have [ and], respectively. You should be able to modify the code for the function so that it does not reference literal bracket symbols, but just uses the list arguments. (Hint: The method index returns the position of an item in a list.) the bracketsBalance function: def bracketsBalance(exp):"""exp is a string that represents the expression""" stk = LinkedStack() for ch in exp: if ch in [’[’, ’(’]: stk.push(ch) elif ch in [’]’, ’)’]: if stk.isEmpty(): # Create a new stack # Scan across the expression # Push an opening bracket # Process a closing bracket# Not balanced return FalsechFromStack = stk.pop()# Brackets must be of…
Given both a list x and a tuple y, write a function called sum_list_andOr_tuple that sums all the elements of both data structures and returns the sum. There is also an optional boolean argument into the function called separate which, if True, causes the function to return the sum of the list and the tuple separately (returns two values); separate is False by default. Please note that the function DOES NOT print anything - it only returns a value(s). See the sample output below: >>> my_list = [0, 9, 99]>>> my_tuple = (8, 12)>>> result = sum_list_andOr_tuple(my_list, my_tuple)>>> print(result) Output: 128>>> result = sum_list_andOr_tuple(my_list, my_tuple, separate = True)>>> print(result) Output: 108, 20
Write a function that takes two arguments, a list L1 and a list L2. • If the length of the list L1 is greater than twice the length of the list L2, then append the first three values of L1 to the three last values of L2. E.g. if L1 = ‘(1 2 3 4 5 6 7) and L2 = ‘(8 9 10), then return ‘(1 2 3 8 9 10) Should be written in the Racket programming language
Write a function called myunion that will take two lists x and y, and return a list that has the elements of x, followed by the elements of y that are not found in x. For example: (myunion ’(1 3 5 7 9) ’(1 2 3 4 5 6 7)) should return (1 3 5 7 9 2 4 6).
Write a function named dictMax which takes two arguments: a dictionary and a list. Your function must look for the keys provided in the list argument, within the dictionary argument and return the maximum of the corresponding values. For example: dictMax({1:3, 3:2, 4:5, 2:6, 7:-1, 6:-3}, [3,2,6]) will return 6, because key 3 in the dictionary corresponds to value 2, key 2 to value 6 and key 6 to value -3, and among 2, 6 and -3, the maximum is 6. If a key does not exist in the dictionary, you should omit it. If none of the keys exist in the dictionary, you should return None.
Write a function that gets a linked list of ints, and reverses it. For example - on input 1 -> 2 -> 3 -> 4, after the function finishes the execution, the list becomes 4 -> 3 -> 2 -> 1 - If the list has one element, then it doesn’t change - If the list is empty, then it doesn’t change You may use the data fields in the struct and the functions provided in LL.h and LL.c. // reverses a linked list void LL_reverse(LL_t* list); Test for the Function: void test_q3() { LL_t* lst = LLcreate(); LL_add_to_tail(lst, 1); LL_add_to_tail(lst, 3); LL_add_to_tail(lst, 8); LL_add_to_tail(lst, 4); LL_add_to_tail(lst, 3); LL_reverse(lst); intcorrect[] = {3,4,8,3,1}; inti; node_t* n = lst->head; for(i=0;i<5;i++) { if (n==NULL) { printf("Q3 ERROR: node %d==NULL unexpected\n", i); return; } if (n->data != correct[i]) { printf("Q3 ERROR: node%d->data==%d, expected %d\n", i, n->data, correct[i]); return; } n = n->next; } if (n==NULL) printf("Q3 ok\n"); } Support…