1 Complete the following function. Note that neither item_list nor index_list should be mutated.1 |2 def find_value_indexes (item_list: list, index_list: list[int],v: object) -> list[int]:"""v may appear multiple times in item_list.3.4index_list contains zero ormore indexes.Return a list of the indexes from index_list at which vappears in item list.7Precondition: the values in index_list are valid indexes in item_list.9.>>> find_value_indexes ([6, 8, 8, 5, 8], [0, 2, 4], 8)[2, 4]1011126.

The program is written in python. You can check the screenshot for the correct indentation. Please…

Complete the following function. Note that neither item_list nor index_list should be mutated. 1 | 2 def find_value_indexes (item_list: list, index_list: list[int], v: object) -> list[int]: """v may appear multiple times in item list. index_1list contains zero or 4 more indexes. Return a list of the indexes from index_list at which v appears in item list. 7 Precondition: the values in index_list are valid indexes in item list. 8 10 >>> find_value_indexes ([6, 8, 8, 5, 8], [0, 2, 4], 8) 11 [2, 4] 3. 6.

Complete the following function. Note that neither item_list nor index_list should be mutated. 1 | 2 def find_value_indexes (item_list: list, index_list: list[int], v: object) -> list[int]: """v may appear multiple times in item list. index_1list contains zero or 4 more indexes. Return a list of the indexes from index_list at which v appears in item list. 7 Precondition: the values in index_list are valid indexes in item list. 8 10 >>> find_value_indexes ([6, 8, 8, 5, 8], [0, 2, 4], 8) 11 [2, 4] 3. 6.

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

1. Write a function called `CleanString` that takes one argument, an accounting number formatted as a string, and returns the number as a float. For example, if the argument is the string '$(7,074,619)', the return value should be the float -7074619. This function should be created in the first code cell below. 2. Iterate over the list `data` and "apply" the function `CleanString` to each element of the list. Save the result to a new list, `cleandata` (this iterating should be completed in the second code cell below).
1. Write a function called chop that takes a list, modifies it by removing the first and last elements, and returns None. For example: >>> t = [1, 2, 3, 4, 5, 6] >>> chop(t) >>> t [2, 3, 4, 5] 2. Write a function called list_median that takes a list and returns a new list. If the list has even numbers of elements, the new list will have two elements. If the list has odd numbers of elements, the new list will include only one element. For example: >>> t1 = [5, 1, 2, 3, 4] >>> list_median(t1) [3] >>> t2 = [8, 3, 10, 6] >>> list_median(t2) [6, 8] 3. Write a function called has_duplicates that takes a list and returns True if there is any element that appears more than once. It should not modify the original list. For example: >>> t1 = [5, 1, 2, 3, 4] >>> has_duplicates(t1) False >>> t2 = [5, 1, 2, 3, 2, 8, 10] >>> has_duplicates(t2) True
• Create a function which takes a tuple and returns a dictionary which is a histogramto count how many times each number exists in the tuple:• The main program must take the dictionary, transform the items into a list,use sort () to order the list (in ascending order) and after that display the list. def histo_n (x):'' '(tuple) -> dictReturns a dictionaryPrecondition: the tuple contains integers>>> t = (1,2, -3,3,4, -3,3,3)>>> histo_n (t){1: 1, 2: 1, 3: 3, 4: 1, -3: 2}'' ' Subject: Python Programming
Write the following function that sorts and merges two lists into a new sorted list. The new list contains only even numbers. def myMergeEvenList(list1, list2): Enter list1: 10,5,6,7 Enter list2: 12,8,5,0,1 The merged list is: 0,6,8,10,12
Introduction In this lab, you are writing a function slashes_to_written(date_list) that gets the list in the [MM, DD, YYYY] format and displays it in a written format. Note: we are using the US format for strings: <MM>/<DD>/<YEAR>. For example, 01/02/2022 can be represented as ['01', '02', '2022'] represents January 2nd, 2022. Written Format slashes_to_written(["01", "01", "1970"]) must return "January 1, 1970" slashes_to_written(["02", "03", "2000"]) must return "February 3, 2000" slashes_to_written(["10", "15", "2022"]) must return "October 15, 2022" slashes_to_written(["12", "31", "2021"]) must return "December 31, 2021" Instructions Finish the slashes_to_written() function Use the dictionary month_names that maps months to their English names. month_names = { 1: "January", 2: "February", 3: "March" ... } Note: the month key in the dictionary is stored as an integer, however, in the list it is stored as a string in the MM format, e.g., "01". Also, pay attention…
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…
Hi, I need help implementing this function into my code. This topic is about getting information out of text files: Function: get_total_cases() takes the a 2D-list (similar to database) and an integer x from this set {0, 1, 2} as input parameters. This function computes the total number of reported cases for each instance of x in the text file, and it stores this information in a dictionary in this form {an_instance_of_x : total_case}. Finally, it returns the dictionary and the total number of all reported cases saved in this dictionary
Please help me write the following function (see the photos for context of the problem): follow_trail(filename, treasure_map, start_row, start_col): Takes as inputs a string corresponding to a filename, a list of lists corresponding to a treasure map, and two non-negative integers representing a row and column index. Follows the trail in the given treasure map, starting at the given row and column index. Following the trail means to look at each character of the trail and perform the appropriate operation for that character: '>', '<', 'v', ' ∧': Continues following the trail by moving to the character to the right, left, below or above the current trail character, respectively. '.': Creates a new map file, with 'new_' prepended to the current map filename, and stores the same treasure map but with an X at the current position. Then, returns a tuple of three elements: the first being -1, and the latter two being the current row and column index. '*': Returns a tuple of three…
in C++... kth Element Extend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the deﬁnitions of these functions in the class linkedListType. PLEASE DON'T reject this question, this is the whole question that I have... so please do it however u can, Thank you!
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.
18) Write a function that takes in 2 lists and checks whether they have the same elements in the same order. If the elements are all the same, the function should return the string “same”. If any of the elements are different, the function should return the string “different”. The definition of the function should be: Def equals(a, b):
in C++ kth ElementExtend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the deﬁnitions of these functions in the class linkedListType. please, do not copy from any other sources, give me a fresh new code. Thank you