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

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

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section7.5: Case Studies

Problem 3E

See similar textbooks

Similar questions

Write the following function in PYTHON a) display_PHU_summary() takes three input parameters, a 2D-list (similar to database), a dictionary (similar to dict), and an integer for the PHU_ID. Your function must print the following information, the id, name, city, website, and the total number of cases reported at this PHU. If the given PHU_ID is invalid, it should print a message and exit the function. >>> display_PHU_summary(database, dict, 2241) PHU id: 2241 PHU name: Kingston Frontenac and Lennox & Addington Public Health PHU city: Kingston, K7M 1V5 PHU website: www.kflaph.ca Total cases: 1 >>> display_PHU_summary(database, dict, 3895) PHU id: 3895 PHU name: Toronto Public Health PHU city: Toronto, M5B 1W2 PHU website: www.toronto.ca/community-people/health-wellness-care/ Total cases: 2 >>> display_PHU_summary(database, dict, 3800) The PHU Id is invalid
Dictionary Swap Write a function called dictionary_swap that takes a dictionary as a parameter. It does not modify the original dictionary, but it creates and returns a new one. Keys from the original dictionary become values in the new one, and values become keys. For example, given the inputs below, your program should return the corresponding values. Input to the Function Returns {'one':1, 'two': 2, 'three':3} {1:'one', 2:'two', 3:'three'} {-1:-10, -2:-20, -3:-30} {-10:-1, -20:-2, -30:-3} {} {}
Problem 2 [Safe Add] Write a function called safeAdd(d, k, v, unsafe=False) that takes either three or four input parameters when called. Here, d is a dictionary, k is a key and v is a value. The function will add the key:value pair k:v to the dictionary d if the key k is NOT in the dictionary. If the key is in the dictionary, the function will display the current value for that key, the new value you passed into the function and ask the user if they wish to proceed and overwrite the existing value. If the optional fourth parameter is True, then just add the key:value pair without checking if the key is already present. Sample run (user input is highlighted) >>> d = {'A':1} >>> safeAdd(d, 'B', 3} >>> display(d) А, 1 В, 3 >>> safeAdd(d, 'B', 2) The key B is already in the dictionary. Current value is 3. Do you want to replace this value with 2? [yes/no] yes >>> display(d) А, 1 В, 2 >>> safeAdd(d, 'A', 12) The key A is already in the dictionary. Current value is 1. Do you want to replace…
c++,CPP,C++ Language (Linked List) Implement the singly linked list of Employee with data members Name, id andsalary. Add at least 5 nodes in the list. You will create a pointer named as head tokeep the address of first node of list. Create the following functions:
C language. Function write the arraylist_sort function This generic function sorts an array list using the given compare function. l An array list compare Pointer to the function which compares two elements If you cannot write down a generic function which works for all types, write down a function which sorts resturants. If you cannot use function pointers, you can write down multiple functions which sort using different criteria.
Tails Function Purpose: Produce a new column-based ( e.g. dict[str, list[str]] ) table with only the first N (a parameter) rows of data for each column. * Function name: Tails Parameters: 1. dict[str, list[str]] - a column-based table of data that_will not be mutated_ 2. int - The number of "rows" to include in the resulting list * Return type: dict[str, list[str]] Implementation strategy: 1. Establish an empty dictionary that will serve as the returned dictionary this function is building up. 2. Loop through each of the columns in the first row of the table given as a parameter. 1. Inside of the loop, establish an empty list to store each of the first N values in the column. 2. Loop through the first N items of the table's column, 1. Appending each item to the previously list established in step 2.1. 3. Assign the produced list of column values to the dictionary established in step 1. 3. Return the dictionary.
Dictionary-Returned Functiona) Define a function, dictSqrt() with a parameter, x: 1) Create a list, num and uses a loop to store, x numbers into the list in the range of (0, x). 2) Create a list, sqrtNum and store all sqrt of the numbers saved in the list above. 3) Use dict() and zip() to create a dictionary, sqrtDict, as the return value with numbers as the keys and their corresponding sqrt as the values.b) Define a main() function to do the following: 1) Get a random integer, n, in the range (1, 10).2) Call dictSqrt() with the argument and print the returned dictionary.c) Call main() function to initiate the tasks to be performed. Example OutputdictSqrt(3)will print the following:{0:0, 1:1, 2:1} PYTHON
2 ) Pascal triangle write a function(in OCaml) val nextpascalrow : int list -> int list = that given a list of integers that correspond to a row of the pascal triangle, it calculates the next row of the pascal triangle. # nextpascalrow [1; 6; 15; 20; 15; 6; 1];; - : int list = [1; 7; 21; 35; 35; 21; 7; 1]
(d) create_area_dict(list2D) that takes a 2D-list containing the database as input and creates a dictionary called area_dict (you may rename it), where keys are the identity number of a CMA (ID) and values are the name of the CMA (Area). This function must return the dictionary. See sample output below. area_dict = create_area_dict(database) display_dict(area_dict) 31 - Cityview - Crestview - Meadowlands 903 - Billings Bridge - Alta Vista 908 - Byward Market 912 Carson Grove Carson Meadows 923 Glebe - Dows Lake 940 Overbrook - McArthur 942 - Portobello South 949 - Sandy Hill 957 - West Centertown (e) create_crime_dict(filename) that takes the filename of a csv file as input and returns a dictionary called crime_dict (you may rename it). This function reads the header of the csv file and stores data in crime_dict such that keys are the indices of a crime type on the header row, and values are the corresponding crime types (names are case sensitive). You can assume that indices start…
Problem 4 (Merging Dictionaries Again) Write a function called merge2(d2, d2) that takes two dictionaries as input parameters. This function will create a new dictionary that contains everything from the two input dictionaries and return it. The same key might appear in both input dictionaries. In the output dictionary, the value for each key will be a list that has all values corresponding to this key in the two input dictionaries. Sample run, >>> d1 = {'a': 100, 'b': 200, 'c':300} >>> d2 = {'a': 300, 'b': 200, 'd':400} >>> d3 = merge2(d1,d2) >>> display(d3) a, [100,300] b, [200,200] c, [300] d, [400]
b. Using user-defined function, create a C++ or Java application implementing a linked list datastructure. The application should be able to perform the following operations on the datastructure can with the following operations.i. Insertion into the list ii. Deletion from the list iii. Printing the content of the list
Estimated Completion Time: 2 minutes You are now working for Prof. Midas on a research project. You are given this piece of code to review which is intended to be a better and faster implementation of a function that checks whether a given key is in a dictionary (i.e., key lookup). You have to present your findings to Prof. Midas. Select all the findings which you will NOT present (i.e., select all answers which are FALSE). def key_in_dict(d, k): for item in d: if k == item: return True return False This code would always be slower than the builtin key lookup Python provides. O A key lookup in a dictionary in Python is generally faster than determining whether a value is in a list. O This code is way faster and will be included in the next version of Python (version 4.1). The code is incorrect from a functional perspective, the True and False should be switched. This code could be replaced with one line: return k in d O The code is correct and would always perform faster than the…