It will throw a ValueError.

It will return an empty dictionary.

It will throw a KeyError.

It will return None.

The size of memory allocated to the dictionary

The number of values in the dictionary

The combined length of all values in the dictionary

The number of keys in the dictionary

Is immutable

Allows duplicate values

Maintains the order of elements

Is unordered and does not allow duplicates

list[-1]

list[last]

list[-2]

list[len(list)]

Lists, Tuples, Sets

Classes, Objects, Inheritance

Dictionaries, Strings, Booleans

Arrays, Functions, Modules

reorder()

reverse()

sort()

swap()

The program will crash with an IndexError.

The program will skip that index.

The program will add the missing index.

The program will return None.

Removes elements common to both sets.

Sorts the elements in both sets.

Combines all elements from two sets.

Finds elements present in both sets.

Using the update() method

Using the .get() method with a default value

Using a for loop to check all keys

Using square brackets (dict[key])

{}

[]

set()

empty()