given a dictionary d and a list lst, remove all elements from the dictionary whose key is an elemenet of lst. Any elements from the list that are not keys of the dictionary should be added to a new set assigned to the variable not_found. For example, given the dictionary {1:2, 3:4, 5:6, 7:8} and the list [1,6,7], the resulting dictionary would be {3:4,5:6} and the set not_found would contain 6. using python

given a dictionary d and a list lst, remove all elements from the dictionary whose key is an elemenet of lst. Any elements from the list that are not keys of the dictionary should be added to a new set assigned to the variable not_found. For example, given the dictionary {1:2, 3:4, 5:6, 7:8} and the list [1,6,7], the resulting dictionary would be {3:4,5:6} and the set not_found would contain 6. using python

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

lst1= [4,3,2,6,2] and lst2=[1,2,4] then the new_list is [2,2,4]. Assign the new-list to variable new_list and sort. Code: What is wrong with this code? lst1= [4,3,2,6,2] lst2=[1,2,4] new_list=[] for elements1 in lst1: for elements2 in lst2: elements1==elements2: new_list.append(elements1) new_list.sort()
Max Absolute In List Function Lab Description Implement function max_abs_val(lst), which returns the maximum absolutevalue of the elements in list.For example, given a list lst: [-19, -3, 20, -1, 0, -25], the functionshould return 25. The name of the method should be max_abs_val and the method should take one parameter which is the list of values to test. Here is an example call to the function print(max_abs_val([-19, -3, 20, -1, 0, -25])) File Name maxabsinlst.py Score There are three tests each worth 2 points Note: You do not need any other code including the main method or any print statements. ONLY the max_abs_val method is required. Otherwise, the autograder will fail and be unable to grade your code. (I.e., do not include the above example in your code.) The above example should be used be test your code but deleted or comment out upon submission. PYTHON LAB
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]
PYTHON CS1 PROBLEM Define a function that takes a dictionary gdict as a parameter and returns a list of values that are associated with only a single key in the dictionary. For example: 1. If gdict = {"a":3, "b": 4, "x": 3, "z": 5, "k": 4, "c": 1} then your function should return the list [1, 5]. 3 and 4 are not in the returned list because they are associated with more than one key. 2. If gdict = {"a":3, "b": 4, "x": 3, "k": 4) then your function should return the list []. 3. If gdict = {} then your function should return the list [].
Question 17 Listlterator has the following disadvantage: It can traverse only a list object but not map or set. It has methods only to remove but not for add or replacing. Index of an element can not be obtained using Listlterator. It can not traverse in the backward direction.
Implement the following function. Hint: You should use a dictionary. def word_pattern (pattern: str, words: List [str]) -> bool: I ''Given a pattern and a word list, determine if the word list follows the same pattern. That is to say, ensure that pattern [j] pattern [k] only when words [j] == words [k] pattern [j] = pattern [k] means words [j] != words [k] Precondition: Assume pattern is all lowercase letters. >>> word_pattern ('aaaa', ['cat', 'cat', 'cat', 'cat']) True and == >>> word_pattern ('yoox', ['dog', 'cat', 'cat', 'fish']) True >>> word_pattern ('xy', ['cat', 'cat']) False >>> word_pattern('xoox', ['dog', 'cat', 'cat', 'fish']) False
In python implement the build_dictionary() function to build a word frequency dictionary from a list of words. Ex: If the words list is: ["hey", "hi", "Mark", "hi", "mark"] the dictionary returned from calling build_dictionary(words) is: {'hey': 1, 'hi': 2, 'Mark': 1, 'mark': 1} Ex: If the words list is: ["zyBooks", "now", "zyBooks", "later", "zyBooks", "forever"] the dictionary returned from calling build_dictionary(words) is: {'zyBooks': 3, 'now': 1, 'later': 1, 'forever': 1} The main code builds the word list from an input string, calls build_dictionary() to build the dictionary, and displays the dictionary sorted by key value.
Question 30 If N represents the number of elements in the list, then the index-based add method of the LBList class is O(N). True False Question 31 A header node does not contain actual list information. True False Question 32 Any class that implements the Comparable interface must provide a compareTo method. True False Question 33 A SortedABList list can only be kept sorted based on the "natural order" of its elements. True False Question 34 O(N) is the order of growth execution time of the add operation when using the SortedArrayCollection class, assuming a collection size of N. True False Question 35 The iterator operation is required by the Iterable interface. Group of answer choices True False Question 36 O(N) is the order of growth execution time of the remove operation when using the SortedArrayCollection class, assuming a collection size of N. True False Question 37 O(N) is the order of growth execution time of the index-based add operation when…
Write the following function that partitions the list using the first element, called a pivot:def partition(lst): After the partition, the elements in the list are rearranged so that all the elements before the pivot are less than or equal to the pivot and the element after the pivot are greater than the pivot. The function also returns the index where the pivot is located in the new list. For example, suppose the list is [5, 2, 9, 3, 6, 8]. After the partition, the list becomes [3, 2, 5, 9, 6, 8]. Implement the function in a way that takes len(lst) comparisons. Write a test program that prompts the user to enter a list and displays the list after the partition.
value_list is read from input. shift_right() has one parameter list_to_modify, and shifts list_to_modify right. Call shift_right() with a copy of the list value_list as the argument to avoid modifying value_list. Ex: If the input is: The best is yet to come, and won't that be fine then the output is: Shifted right: ['fine', 'The', 'best', 'is', 'yet', 'to', 'come,', 'and', "won't", 'that', 'be'] Original: ['The', 'best', 'is', 'yet', 'to', 'come,', 'and', "won't", 'that', 'be', 'fine']
Assume that the node of a linked list is in the usual info-link form with the info of the type of int. The following data, as described in parts (a) to (d), is to be inserted into an initially linked list: 72, 43, 8, 12. Suppose that head is a pointer of type nodeType. After the linked list is created, head should point to the first node of the list. Declare additional variables as you need them. Write the C++ code to create the linked list. After the linked list is created, write a code to print the list. What is the output of your code? Insert 72 into an empty linked list. Insert 43 before 72. Insert 8 at the end of the list. Insert 12 after 43
Write a Python Code for the given function and conditions: Given function: def insert(self, newElement) Pre-condition: None. Post-condition: This method inserts newElement at the tail of the list. If an element with the same key as newElement already exists in the list, then it concludes the key already exists and does not insert the key.