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

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

def remove_after_kth(items, k=1): Given a list of items, some of which may be duplicated, create and return a new list that is otherwise the same as items, but only up to k occurrences of each element are kept, and all occurrences of that element after those first k are discarded. Hint: loop through the items, maintaining a dictionary that remembers how many times you have already seen each element. Update this count as you go, and append each element to the resultlist only if its count is still at most equal to k. items k expected results [42, 42, 42, 42, 42, 42, 42] 3 [42, 42, 42] ['tom', 42, 'bob', 'bob', 99, 'bob', 'tom', 'tom', 99] 2 ['tom', 42, 'bob', 'bob', 99, 'tom', 99] [1, 2, 3, 4, 5, 4, 3, 2, 1, 2, 3, 4, 5, 4, 3, 2, 1] 1 [1, 2, 3, 4, 5] [1, 2, 3, 4, 5, 4, 3, 2, 1, 2, 3, 4, 5, 4, 3, 2, 1, 2, 3, 4, 5] 3 [1, 2, 3, 4, 5, 4, 3, 2, 1, 2, 3, 4, 5, 1, 5] [42, 42, 42, 99, 99, 17] 0 [ ] Please add comments between the codes so I can understand
Is there a different way to write this function in python? Please provide the code. Thanks!
Read strings from input until 'stop' is read. For each string read: If the string is a key in dictionary patients_record, delete the key from patients_record and output the string followed by ' deleted'. Otherwise, output the string followed by ' not a key'.
How can I read from a file a string version of a nested dictionary and store as a dictionary? For example, I have the following nested dictionary: {1: {'Name': 'Bob', 'Pass': 'pass123', 'Sports': ['Hockey', 'Football'], 'Activities': ['eating', 'sleeping']} ; 2: {'Name': 'Kayla', 'Pass': 'cyansus', 'Sports': [], 'Activities': []}} To write this to a file I needed to convert to a string (and it is fine writing to a file). But I am having trouble reading this from the file and creating a nested dictionary from it. I can read the string in fine but creating the nested dictionary I am lost at. Any help will be appreciated. Thank you
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]
at the last itration insade the algrothim what will be the value above of the variables:first,mid,last
PYTHON!!! Write a function that will filter course grades that are stored in a list, creating and returning a new list. Your implementation must have the following rules: - The function must accept two (and only two) parameters: The first is: the maximum integer value for any grade to remain in the list (any value above the maximum will be filtered and removed from the list). The second is: the list of grades (you can assume the list contains only integer values) - The function must return a new list and not modify the existing list. - The function must use a list comprehension to filter the existing list and create the new list that is returned. - DO NOT USE THE: built-in-"filter" function.
Write the function called arrange that takes a list of integers (positive and negative) as an input parameter. The arrange function must use a deque data structure to arrange the integers so the negative numbers occur before the positive numbers (note that the function doesn't sort the values). The function returns a new list containing the rearranged elements. For instance, for the input list [-3, 12, 6, -7, -1, 8], the function would return [-1, -7, -3, 12, 6, 8]. Write the main function to test the arrange function using various inputs. dequeue.py file class Deque: def __init__(self): self.items = [] def is_empty(self): return self.items == [] def add_front(self, item): self.items.append(item) def add_rear(self, item): self.items.insert(0,item) def remove_front(self): return self.items.pop() def remove_rear(self): return self.items.pop(0) def size(self): return len(self.items)
program9_1.pyThis assignment requires you to create a dictionary by reading the text file created for the Chapter 6 assignment. The dictionary should have player names for the keys. The value for each key must be a two-element list holding the player's goals and assists, respectively. See page 472! Start with an empty dictionary. Then, use a loop to cycle through the text file and add key-value pairs to the dictionary. Close the text file and process the dictionary to print the stats and determine the top scorer as before. In fact, much of the code used in program6_2.py can be copied and used for this program. Printing the stats for each player is the most challenging part of this program. To master this, refer to the examples in the zip file that can be downloaded from the "Dictionary values can be lists" link in the "Learn Here" part of this module. NOTE: you do not need to submit the text file. Submit just this program. The required output should be the same well-formatted table as…
3. Write the remove_evens() function that receives a list of integers as a parameter and returns a new list of integers containing only the odd numbers from the original list. Ex1) If n = [1, 2, 3, 4, 5, 6], remove_evens(n) returns [1, 3, 5]. Ex2) If n = [2, 4, 8], remov move_evens(n) returns [].
In python: student_dict is a dictionary with students' name and pedometer reading pairs. A new student is read from input and added into student_dict. For each student in student_dict, output the student's name, followed by "'s pedometer reading: ", and the student's pedometer reading. Then, assign average_value with the average of all the pedometer readings in student_dict..
Which of the following function chooses a random index as the pivot? A. int Median(arr, left, right) { int mid; mid = (left + right)/2 if (arr[right] arr[left]); Swap(arr, left, right); //to swap arr[left],arr[right] if (arr[mid] < arr[left); Swap(arr, mid, left);//to swap arr[left],arr[mid] if (arr[right] < arr[mid]); Swap(arr, right, mid);// to swap arrſright],arr[mid] return mid; } С. int Median(arr, left, right) { int mid; mid = (left + right)/2 if (arr[left] < arr[right]); Swap(arr, left, right); //to swap arr[left],arr[right] if (arr[left] < arr[mid]); Swap(arr, mid, left);//to swap arr[left],arr[mid] if (arr[right] < arr[mid]); Swap(arr, right, mid);// to swap arr[right),arr[mid] return mid; } D. int Median(arr, left, right) { int mid; mid = (left + right)/2 if (arr[right] < arr[left); Swap(arr, left, right); //to swap arr[left],arr[right] if (arr[left] < arr[mid]); Swap(arr, mid, left);//to swap arr[left],arr[mid] if (arr[mid] < Swap(arr, right, mid);// to swap…