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] %3! %3D

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] %3! %3D

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

create a function in python parameters: 1. dict[str, list[str]] 2. list[str] return type: dict[str, list[str]] must do like this: 1. establish an empty dictionary that will serve as the dictionary returned at the end 2. loop thorugh each of the columns in the second parameter of the function 2a. asssign to the column key of the result dictionary the list of values stored in the input dictionary at the same column 3. return the dictionary produced do not import other libraries such as pandas, .select, .head, .iloc or anything this function is being used to work in a dataframe
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
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…
You are given the pointer to the head node of a linked list and an integer to add to the list. Create a new node with the given integer. Insert this node at the tail of the linked list and return the head node of the linked list formed after inserting this new node. The given head pointer may be null, meaning that the initial list is empty. Function Description Complete the insertNodeAtTail function in the editor below. insertNodeAtTail has the following parameters: SinglyLinkedListNode pointer head: a reference to the head of a list int data: the data value for the node to insert Returns SinglyLinkedListNode pointer: reference to the head of the modified linked list Input Format The first line contains an integer , the number of elements in the linked list.The next lines contain an integer each, the value that needs to be inserted at tail. Constraints Sample Input STDIN Function ----- -------- 5 size of linked list n = 5 141 linked list data values…
You have been given the following lists of students and their test scores: names=['Joe','tom','bob','sue','sally'] Scores=[10,23,13,18,12]Write a function, makeDictionary , that takes the two lists and returns a dictionary with the names as the keys and the scores as thevalues. Assign the result of makeDictionary to scoreDict .calculate the average of all the scores in scoreDict in python.
Write a function named create_names_dictionary (initials_list, names_list) which takes a list of initials and a list of names as parameters. The function returns a dictionary by looping through each element in the first and the second list and creating a corresponding key:value item. The 'key' of each item in the dictionary is the initials of the first name and surname, and the 'value' is the name (e.g. key of 'AW", value of 'Alex Wong'). For example, the following code: names_list = ['Abby Anderson', 'Bella Campbell'] initials ['AA', 'BC'] my_dictionary = create_names_dictionary (initials, names_list) print(my_dictionary) produces {'AA': 'Abby Anderson', 'BC': 'Bella Campbell'} You can assume that both parameters are the same length and that the initials_list does not contain any duplicates. For example: Test Result names_list = ['Abby Anderson', 'Bella Campbell', 'Charlotte Donovan'] AA Abby Anderson initials = ['AA', 'BC', 'CD'] BC Bella Campbell my_dictionary =…
Part I Implementation In this part you are asked to write functions with python . Define a two dimensional list with NxN elements. This list should be filled with random numbers between 100 and 200. . Write a function that takes a table as a parameter and prints list elements with table shape • Write a function that takes a table as a parameter and return a list that holds diagonal (left-top corner to bottom-right) elements. Write a function that takes a table as a parameter and returns number of all odd numbers in the table Note: You are not allowed to use Numpy package. Part II Test
13. While dictionaries are designed so that we can find a value based on a key, every so often we need to perform a reverse lookup. For example, imagine a dictionary where the keys are names and the values are phone numbers. Usually we want to find the phone number based on the name, but occasionally you might need to find a name based on the phone number. Write a function called reverse_lookup(dictionary, value) that returns all the keys in the dictionary associated with the specified value. Note: In dictionaries, the keys are guaranteed to be unique, but the values are not. So your function should return a list containing all of the matching keys (if any) Example: Given this dictionary, groups = {'Apple': 'Fruit', 'Spinach': 'Vegetable', 'Banana': 'Fruit'} reverse_lookup (groups. Vegetable') ["Spinach'] reverse_lookup (groups, Fruit') ['Apple'. 'Banana'] reverse_lookup (groups. 'Meat') []
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 code of the following functions: def fillX(pointsX,lowerLimit, upperLimit): This function receives a list pointsX and returns the same list with values between loverLimit and upperLimit. There are number of them.
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 find_key(input_dict, target_value) that takes as parameters a dictionary and a target value and returns the key in the dictionary that maps to the target value or None if no such key exists. In other words, the function finds the key such that input_dict[key] == target_value. Notes: You may assume that the target_value only appears once in the dictionary and therefore there will be only one key that maps to the target. Hint: You need to iterate over all the keys, as this task is effectively using the dictionary backwards. For example: Test Result test_dictionary = {100:'a', 20:'b', 3:'c', 400:'d'} print(find_key(test_dictionary, 'b')) 20 test_dictionary = {100:'a', 20:'b', 3:'c', 400:'d'} print(find_key(test_dictionary, 'e')) None