Answer to Question #171437 in Python for Paul Carpenter

Question #171437


Create a Python dictionary that returns a list of values for each key. The key can be whatever type you want.


Design the dictionary so that it could be useful for something meaningful to you. Create at least three different items in it. Invent the dictionary yourself. Do not copy the design or items from some other source.



def invert_dict(d):

inverse = dict()

for key in d:

val = d[key]

if val not in inverse:

inverse[val] = [key]

else:

inverse[val].append(key)

return inverse


Modify this function so that it can invert your dictionary. In particular, the function will need to turn each of the list items into separate keys in the inverted dictionary.


Run your modified invert_dict function on your dictionary. Print the original dictionary and the inverted one.


Include your Python program and the output in your Learning Journal submission.


Describe what is useful about your dictionary. Then describe whether the inverted dictionary is useful or meaningful, and why.


1
Expert's answer
2021-03-14T15:43:28-0400
def invert_dict(d):
    inverse = dict()
    for key in d:
        val = d[key]
        for item in val:
            if item not in inverse:
                inverse[item] = [key]
            else:
                inverse[item].append(key)
    return inverse


my_dict = {"London": ["Oxford Street", "Abbey Road", "Brick Lane", "Carnaby Street"],
           "New York": ["1st Ave.", "1st Ave Loop.", "1st Pl.", "2nd Ave."],
           "Berlin": ["Kaiserdamm", "Karl-Liebknecht-Strasse", "Karl-Marx-Allee", "Kopenhagener Strasse",
                       "Kurfürstendamm"]}

print('Original dictionary')
print(my_dict)
in_dict = invert_dict(my_dict)
print("Inverted dictionary")
print(in_dict)

The inverted dictionary is useful if one needs to find the city the exact street belongs to


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!

Leave a comment

LATEST TUTORIALS
New on Blog
APPROVED BY CLIENTS