Implement the function merge_dict. The merge_dict function merges two dictionaries with the same keys together by adding up their values for the corresponding keys and returning the resulting dictionary. def merge_dict(d1, d2): """Returns a dictionary that is the result of two dictionaries being merged together. Dictionaries are merged by adding up their values. You can assume that the same keys appear in both dictionaries. >>> data8 = {"midterms":1, "projects":3} >>>data100 = {"midterms": 2, "projects":3} >>> combined_exams = merge_dict (data8, data100) >>> combined_exams {'midterms': 3, 'projects': 6} >>> sunday_orders = {"pizza": 3, "hot dogs": 2, "fries": 5} >>> monday_orders = {"pizza": 1, "hot dogs": 1, "fries": 8} >>> combined_orders = merge_dict (sunday_orders, monday_orders) >>> combined_orders {'pizza': 4, 'hot dogs': 3, 'fries': 13} HI "**** YOUR CODE HERE *****"

Implement the function merge_dict. The merge_dict function merges two dictionaries with the same keys together by adding up their values for the corresponding keys and returning the resulting dictionary. def merge_dict(d1, d2): """Returns a dictionary that is the result of two dictionaries being merged together. Dictionaries are merged by adding up their values. You can assume that the same keys appear in both dictionaries. >>> data8 = {"midterms":1, "projects":3} >>>data100 = {"midterms": 2, "projects":3} >>> combined_exams = merge_dict (data8, data100) >>> combined_exams {'midterms': 3, 'projects': 6} >>> sunday_orders = {"pizza": 3, "hot dogs": 2, "fries": 5} >>> monday_orders = {"pizza": 1, "hot dogs": 1, "fries": 8} >>> combined_orders = merge_dict (sunday_orders, monday_orders) >>> combined_orders {'pizza': 4, 'hot dogs': 3, 'fries': 13} HI " YOUR CODE HERE *"

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

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
In Python: make_dict(n) Write a function called `make_dict(n)`, where n is an integer parameter. With a given number n, make a new dictionary in your function where the keys in the dictionary are in the range from 1 to n, and value for each key is the square of the key for that entry. Your function should return this dictionary, not print it. main() Call `make_dict(n)`, where the user is asked to specify a number to pass into `make_dict(n)`, and then prints the returned dictionary object.
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
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 =…
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') []
Please answer it in Python Write a function incrementer_scores that takes two dictionaries as arguments score_total and score_partiel of the same format used to count scores. The function modifies the dictionary score_total to add to each player the number of points appearing in score_partiel. This function will be used for example to put updates player scores after a round of play. For example, if the dscores dictionary contains {'tata': 3, 'titi': 12, 'toto': 0}, t hen, after calling incrementer_scores(dscores, {'titi': 1, 'toto': 0, 'tata': 11}), t he dscores dictionary will contain {'tata': 14, 'titi': 13, 'toto': 0}
Complete the partition() function which takes a single list of integer values data as a parameter. The function rearranges the elements within the list. The function does not return anything. The elements are rearranged as follows: • All negative numbers are removed. • All odd numbers are sorted in order from smallest to biggest, and before any even numbers. • All even numbers are sorted in order from biggest to smallest and after any odd numbers. • Any values of 0 appear after the odd numbers and before the even numbers (i.e., they separate the odd from even values). Note: • An empty list is valid and will be printed as an empty list. For example: Test data = [0, 1, 2, 3, 4, 5, -5, -4, -3, -2, -1, 0] [1, 3, 5, 0, 0, 4, 2] partition (data) print (data) data = [0, 0, 0, 2, 2, 4, 5, 6, 7, 6, 5, 3, 1] partition (data) print (data) data = [-1, -3] partition(data) print (data) Result [1, 3, 5, 5, 7 0, 0, [] 6, 6, 4, 2, 2]
python: def traditions_dict(adict): """ Question 6 Given a dictionary that maps a person to a list of their favorite traditions, return a dictionary with the value being the list sorted by the last letter of each tradition. If two traditions have the same last letter, sort by the first letter. HINT: This will require the use of lambda functions Args: adict (dict) Returns: dict >>> traditions_dict({"Jacob": ["The Horse", "Stealing the t", "Midnight Bud"], "Athena": ["Mini Five-Hundred", "Freshman Cake Race", "Buzzweiser Song"], "Liv": ["Freshman Cake Race", "George P. Burdell", "Buzzweiser Song"]}) {'Jacob': ['Midnight Bud', 'The Horse', 'Stealing the t'], 'Athena': ['Mini Five-Hundred', 'Freshman Cake Race', 'Buzzweiser Song'], 'Liv': ['Freshman Cake Race', 'Buzzweiser Song', 'George P. Burdell']} >>> traditions_dict({"Madison": ["The Horse", "Midnight Bud", "Buzzweiser…
void dict_clear (dict_t* dict); This function clears the dictionary dict, destroying each pair key/value, but does not destroy dict itself (remember that dict was allocated using dict_create, so it will need to be freed at some point, but this is not this function’s job.) This is now the function that frees (destroys) a dictionary: void dict_destroy (dict_t* dict); This operates just as dict_clear, but in addition should free the memory that was allocated during dict_create. After a call to this function, if any other library function receives the pointer dict, the behavior is undefined (most likely, it will crash). This simple function returns the current size of the dictionary: size_t dict_size (const dict_t* dict);
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.
Task 7 Suppose you are given two dictionaries. Now create a new dictionary "marks", merging the two dictionaries, so that the original two dictionaries remain unchanged. Note: You can use dictionary functions. Given: {'Harry':15, 'Draco':8, 'Nevil":19} {'Ginie':18, 'Luna': 14} Output: {'Harry': 15, 'Draco': 8, 'Nevil": 19, 'Ginie": 18, 'Luna': 14}
Python Write a function print_dict to print all the key-values in a dictionary, for example: >>> d2 {'a': 'one', 'b': 'two', 'c': 'Three'} >>> print_dict(d2) a:one b:two c:Three