Given a dictionary d, return a new dictionary where all occurences of x as a value (not a key) is replaced with y. def replace_all(d, x, y): >>> d = {'foo': 2, 'bar': 3, 'garply': 3, 'xyzzy': 99} >>>e= replace_all(d, 3, 'poof') >>> e == {'foo': 2, 'bar': poof', 'garply': 'poof', 'xyzzy': 99} True HHH www "*** YOUR CODE HERE *******"

Given a dictionary d, return a new dictionary where all occurences of x as a value (not a key) is replaced with y. def replace_all(d, x, y): >>> d = {'foo': 2, 'bar': 3, 'garply': 3, 'xyzzy': 99} >>>e= replace_all(d, 3, 'poof') >>> e == {'foo': 2, 'bar': poof', 'garply': 'poof', 'xyzzy': 99} True HHH www "* 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

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);
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
def most_total(bdm): '''(dict of {str: dict of {int: list of str}}) -> str bdm is a birthday month dictionary with at least one key. Return the name of the month with the most total days on which someone has a birthday. If there is a tie, return any month with that maximum. >>> d = {"Jan": {1: ["Steve"], 5: ["Bob"], 31: ["Ron"]}, "Aug": {1: ["Jim", "Tim"], 24: ["Sadia", "Tony"]}} >>> most_total(d) 'Aug' '''
Code the following directions in python. 1.Assume the variable dct references a dictionary. Write an if statement that determines whether the key 'Jim' exists in the dictionary. If so, delete 'Jim' and its associated value. 2.Write code to create a set with the following integers as members: 10, 20, 30, and 40. 3.Assume each of the variables set1 and set2 references a set. Write code that creates another set containing all the elements of set1 and set2, and assigns the resulting set to the variable set3.
Homework Assignment-1Topics: Functions, Dictionary, ImportProblem description: Write a python application to simulate an online clothing system. Thepurpose of this assignment is to gain experience in Python dictionary structure, create basicPython functions and import a module.Design solution: The template file contains a list of clothes item sold, each item in the listcontains the item id, name of the item and the prices. The program will generate an items_dictwhere each key is the item id of the cloth and the values will be a list of item name and priceinformation. A customer will be presented with a main menu with 4 different options: displayall items, add an item to cart, checkout and exit the program. A customer can buy an item byentering the ID of the item. This program implements a dictionary called cart, where each key isthe item id and the values are the list of name, price and quantity that user chooses topurchase. The program keeps repeating by displaying the main menu to…
dictionary = { 37:1, 38:2, 39:2, 40:1, 41:1, 42:2, 43:3, 44:1, 45:2, 46:3, 47:1, 48:1, 49:2, 50:3, 51:2, 52:2, 53:3, 54:3, 55:1, 56:2 } def examFun (val): if val < 1: return 0 if val < 3: return if val < 5: return if val < 6: return if val < 9: return if val < 19: dictionary [56] dictionary [37] dictionary [42] dictionary [53] return dictionary[39] + examFun (6) return dictionary[52] + examFun(val - 16) + examFun(val - 23) print( examFun (27) % 10 )
Implement the following: Given: person = {'name': 'bob'}1) Add the key/value pair 'emplStatus': 'Retired' to the dictionary person.2) Access the values in the dictionary person to print the following. Example OutputBob's employment status is Retired. NEED HELP WITH PYTHON
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…
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…
get_movie_dict() takes a 2-D list similar to movie_db and a dictionary similar to ratings as the parameters and returns a dictionary, where each {key: value} of this dictionary is {a valid movie id: a list containing the name of the movie, the year it got released, and the average rating of this movie}. I will refer to this dictionary as movies.>>> movies = get_movie_dict(movies_db, ratings)>>> display_dict(movies)1: ['Toy Story', 1995, 3.92]2: ['Jumanji', 1995, 3.43]3: ['Grumpier Old Men', 1995, 3.26]4: ['Waiting to Exhale', 1995, 2.36]5: ['Father of the Bride Part II', 1995, 3.07]6: ['Heat', 1995, 3.95]7: ['Sabrina', 1995, 3.19]8: ['Tom and Huck', 1995, 2.88]9: ['Sudden Death', 1995, 3.12]10: ['GoldenEye', 1995, 3.5]11: ['American President The', 1995, 3.67]12: ['Dracula: Dead and Loving It', 1995, 2.42]13: ['Balto', 1995, 3.12]14: ['Nixon', 1995, 3.83]15: ['Cutthroat Island', 1995, 3.0]16: ['Casino', 1995, 3.93]17: ['Sense and Sensibility', 1995, 3.78]18: ['Four…
Exercise: Least Dictionary Value Description In this exercise you will find the value in a dictionary with the least value. Least means that the value is less than or equal to all other values in the dictionary. Remember that the 2 Assistant Object inspector
185e def find(self, key): 186e 187 188 Efficiency: 189 Finds and returns a copy of value in the set that matches key. Use: value = source.find(key) 190 191 192 193 Parameters: 194 key - a partial data element (?) 195 Returns: 196 value - a copy of the full value matching key, otherwise None (?) 197 198 199 200 # your code here 201