Question

For Python 3 MPLS please

1. Given a variable, unproved_conjectures, that is associated with a dictionary that maps the common names of mathematical conjectures to the years when the conjectures were made, write a statement that deletes the entry for "Fermat's Last Theorem".

2. Given a dictionary d, create a new dictionary that reverses the keys and values of d. Thus, the keys of d become the values of the new dictionary and the values of d become the keys of the new dictionary. You may assume d contains no duplicate values (that is, no two keys map to the same values.) Associate the new dictionary with the variable inverse.

3. Given the dictionary, d, find the largest key in the dictionary and associate the corresponding value with the variable val_of_max. For example, given the dictionary {5:3, 4:1, 12:2}, 2 would be associated with val_of_max. Assume d is not empty.

4. Given the string line, create a set of all the vowels in line. Associate the set with the variable vowels.

5. Remove the smallest element from the set, s. If the set is empty, it remains empty.

Answer 1

1.

// Delete the entry for "Fermat's Last Theorem" from dictionary unproved_conjectures

keyToDelete = "Fermat's Last Theorem"

#checks if key Fermat's Last Theorem is present in unproved_conjectures

if keyToDelete in unproved_conjectures.keys():

               del unproved_conjectures[keyToDelete] # if present, delete it

2.

def reverse_dictionary(d):

inverse = {} # new dictionary

               d_keys = d.keys() # get the list of keys in d

               # loop to reverse the dictionary

               for key in d_keys:

inverse[d[key]] = key

               return inverse

3.

# function to return the value associated with the maximum key of dictionary

def maxKeyValue(d):

               d_keys = d.keys() # get the list of keys of dictionary, d

               # if dictionary is not empty

               if(len(d_keys) > 0):           

                              max = d_keys[0] # set the first key as max

                              # loop to find the maximum key

                              for i in range(1,len(d_keys)):

                                             if max < d_keys[i]:

                                                            max = d_keys[i]

                              return d[max] # return the value associated with maximum key

               else:

                              return None # no keys in dictionary

4.

# function that returns the set of all vowels in a string line                             

def vowels_set(str):

               vowels = set() # result set

               valid_vowels = 'aeiouAEIOU' # string of valid vowels

              

               # loop over each alphabet in the input string, str

               for alphabet in str:

                              if alphabet in valid_vowels: # if alphabet is vowel

                                             vowels.add(alphabet) # add to set

               return vowels                    #return the set

5.

# function to remove smallest element from input set, s   

def remove_smallest(s):

               if len(s) == 0: # if set s is empty then return

                              return

               minimum_item = min(s) # get the minimum element from set s

              

               s.discard(minimum_item) # remove the minimum element