• Create a function which takes a tuple and returns a dictionary which is a histogram to 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) -> dict Returns a dictionary Precondition: 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} '' '

• Create a function which takes a tuple and returns a dictionary which is a histogram to 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) -> dict Returns a dictionary Precondition: 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} '' '

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 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 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 and test that creates a dictionary containing the Canadian provinces and territories as keys and their capitals as values. (Use the Internet to get a list of the provinces and their capitals.) The __main__ guard portion of the program should then randomly quiz the user by displaying the name of a state and asking the user to enter that state’s capital. The program should keep a count of the number of correct and incorrect responses. （Use python and pytest）
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.
Instructions are given within the quotations for each function. 1)def remove_duplicate_sorted(t): """ this function returns a new list generated from t that has t's elements without duplicates and is sorted from smallest to largest. """ return [] 2)def list_to_dictionary(t): """ t is a list of values (values could be str, list, tuple, set, dictionary), create and return a dictionary such that the key is len(v) for some v in t, and the value is a list of values [v1, v2, ...] from t (in the order they appeared in t) whose len(vi) is the key. for example: if t = [(1,2,3), "abc", [1, 2], (), ""] then return value of this function should be: {3: [(1, 2, 3), 'abc'], 2: [[1, 2]], 0: [(), '']} """ return {} 3)def run(): """ This function repeatedly ask user to enter a string and store them in a list and print it out. It also passes this list to remove_duplicate_sorted() function and list_to_dictionary() function and print out the results of the function calls. """ return if __name__ ==…
Suppose we use a Python dictionary to store gradebooks of multiple courses. gradebooks = {'Course 1': [['Troy', 92], ['Alice', 95]], 'Course 2': [['James', 89], ['Charles', 100], ['Bryn', 59]], 'Course 3': [['Jack', 74], ['Karren', 97], ['Astha', 92], ['Nancy', 96]]} Use the builtin sorted function with appropriate programming constructs (e.g., lambdas, comprehensions, , etc.) to complete the following tasks: Write code to create a new list named gradebooks_a, with students of each course being sorted by score in descending order. The expected result is: [[['Alice', 95], ['Troy', 92]], [['Charles', 100], ['James', 89], ['Bryn', 59]], [['Karren', 97], ['Nancy', 96], ['Astha', 92], ['Jack', 74]]]
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 existing amount. ingr is a list of tuples, where each tuple represents the required amount 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 item in 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…
note: use python and not import 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 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
Q1:Write a function that returns a new list by eliminating theduplicate values in the list. Use the following function header:def eliminateDuplicates(lst):Write a test program that reads in a list of integers, invokes the function,and displays the result. Here is the sample run of the program Enter ten numbers: 2 3 2 1 6 3 4 5 2The distinct numbers are: 1 2 3 6 4 5 Q2:Write a program that reads in your Q1 Pythonsource code file and counts the occurrence of each keyword in the file.Your program should prompt the user to enter the Python source code filename. This is the Q1: code: def eliminateDuplictes(lst):newlist = [] search = set() for i in lst: if i not in search: newlist.append(i) search.add(i) return newlist a=[] n= int(input("Enter the Size of the list:")) for x in range(n):item=input("\nEnter element " + str(x+1) + ":") a.append(item) result = eliminateDuplictes(a) print('\nThe distinct numbers are: ',"%s" % (' '.join(result)))
#### Part 1 Write a Python function (`binary_search`) that implements the binary search algorithm. This function will take a list argument (`values`), a value to search for (`to_find`), a start index (`start_index`), and an end index (`end_index`). The function will return `True` if `to_find` is present in `values`, and `False` otherwise. Below, you will find some code to test your binary search: ```python values = [2,4,6,8,10,12,14,16,18,20] print(binary_search(values, 14, 0, len(values) - 1)) print(binary_search(values, 7, 0, len(values) - 1)) ``` The output of the test code is below: ``` True False ``` #### Part 2 Modify your `binary_search` function to count the number of comparisons (==, <, <=, >, or >=). The function will now return both the number of comparisons made and the `True` or `False` result. The code below calls your function, and creates a simple ASCII bar chart of the number of comparisons (divided by 10, to account for small differences). Some…
Write a function called list_to_dict(lst) that takes a 2-D list of sales records of this form.[["customer1", "bread", 5], ["customer2", "bread", 4.5], ["customer1", "egg", 6.75]]Your function will store the sales information in a dictionary, where each {key:value} pair of the dictionary stores {a unique customer: [ a list of all products purchased by this customer, total cost of these products]}, and returns the dictionary. Sample run,sales = [ ["customer1", "bread", 5], ["customer2", "bread", 4.5], ["customer1", "egg", 6.75],["customer2", "milk", 4.35], ["customer3", "egg", 3.6], ["customer4", "bread", 4.5],["customer1", "milk", 4.35], ["customer2", "egg", 3.6], ["customer4", "milk", 4.35] ]>>> record = list_to_dict(sales)>>> display(record)customer1 : [['bread', 'egg', 'milk'], 16.1]customer2 : [['bread', 'milk', 'egg'], 12.45]customer3 : [['egg'], 3.6]customer4 : [['bread', 'milk'], 8.85]