Question 1

In the hashing implementation of a set, self.index refers to the index of the chain in which the node was just located, or is -1 otherwise.

Accepted Answer

A) True 
 B)False  True

Question 2

In the code for the __iter__ method for the ArrayDict class, what is the missing code? def __iter__(self):
Cursor = 0
While cursor

Accepted Answer

A)  return(self.items[ cursor ]) 
B)  cursor -= 1 
C)  return(self.items[ key ]) 
D)  cursor += 1 
A)  return(self.items[ cursor ]) 
B)  cursor -= 1 
C)  return(self.items[ key ]) 
D)  cursor += 1 D

Question 3

The AbstractSet class is a subclass of AbstractBag .

Accepted Answer

A) True 
 B)False  False

Question 4

In the code for the __sub__ method for the AbstractSet class, what is the missing code? def __sub__(self, other):
Difference = type(self)()
For item in self:
If not item in other:

Return difference

Accepted Answer

A)  difference.remove(item) 
B)  intersection.add(item) 
C)  difference.add(item) 
D)  return(item) 
A)  difference.remove(item) 
B)  intersection.add(item) 
C)  difference.add(item) 
D)  return(item)

Question 5

A small load factor and an array length that is a prime number increases the chances for a hashing collision.

Accepted Answer

A) True 
 B)False

Question 6

To reduce the probability of collisions with hashes, you can decrease the array length.

Accepted Answer

A) True 
 B)False

Question 7

Referring to the keysToIndexes function, what is the result of the following statement? keysToIndexes([ 39, 18, 4, 51, 6, 28 ], 17)

Accepted Answer

A)  [ 6, 2, 5, 1, 7, 12 ] 
B)  [ 7, 3, 6, 2, 8, 13 ] 
C)  [ 4, 2, 3, 1, 5, 10 ] 
D)  [ 5, 1, 4, 0, 6, 11 ] 
A)  [ 6, 2, 5, 1, 7, 12 ] 
B)  [ 7, 3, 6, 2, 8, 13 ] 
C)  [ 4, 2, 3, 1, 5, 10 ] 
D)  [ 5, 1, 4, 0, 6, 11 ]

Question 8

Which of the following is a subset of Set A if Set A is {19 4 26 8}?

Accepted Answer

A)  None of the choices are subsets of Set A 
B)  {19 4 26 8 0} 
C)  {4 8 19 26 44} 
D)  {} 
A)  None of the choices are subsets of Set A 
B)  {19 4 26 8 0} 
C)  {4 8 19 26 44} 
D)  {}

Question 9

Array-based implementations of sets and dictionaries do not perform well.

Accepted Answer

A) True 
 B)False

Question 10

A set is similar to a bag, but it contains unique data items and additional methods.

Accepted Answer

A) True 
 B)False

Question 11

In the implementation of the AbstractDict class, which four methods have the same implementation for all dictionaries?

Accepted Answer

A)  keys, values, __add__, __eq__ 
B)  entries, values, __init__, __str__ 
C)  keys, values, entries, get 
D)  get, __add__, keys, __init__ 
A)  keys, values, __add__, __eq__ 
B)  entries, values, __init__, __str__ 
C)  keys, values, entries, get 
D)  get, __add__, keys, __init__

Question 12

In the code for the __init__ method in the Entry class or a dictionary, what is the missing code? def __init__(self, key, value):

Self.value = value

Accepted Answer

A)  key = self.key 
B)  self.key = key 
C)  value = self.key 
D)  self.key = value 
A)  key = self.key 
B)  self.key = key 
C)  value = self.key 
D)  self.key = value

Question 13

In the Entry class for a dictionary, comparisons are done using the value item in each entry.

Accepted Answer

A) True 
 B)False

Question 14

Python supports multiple inheritance, so a class can have more than one parent class.

Accepted Answer

A) True 
 B)False

Question 15

Which method is specific to a set compared to a bag?

Accepted Answer

A)  remove 
B)  __str__ 
C)  add 
D)  __sub__ 
A)  remove 
B)  __str__ 
C)  add 
D)  __sub__

Question 16

The standard Python hash function always returns a unique positive integer.

Accepted Answer

A) True 
 B)False

Question 17

What is the performance value of the array-based implementations of sets and dictionaries?

Accepted Answer

A)  O( n 2) 
B)  O( n ) 
C)  O n  
D)  O(1) 
A)  O( n 2) 
B)  O( n ) 
C)  O n  
D)  O(1)

Question 18

For a key value of 93 and a hashing function of key % 46 , what is the index into the array?

Accepted Answer

A)  1 
B)  2 
C)  46 
D)  47 
A)  1 
B)  2 
C)  46 
D)  47

Question 19

In which collision-avoidance hashing strategy are the items stored in an array of linked lists in which each item's key locates the bucket where the item is to be inserted?

Accepted Answer

A)  clustering 
B)  chaining 
C)  quadratic probing 
D)  linear probing 
A)  clustering 
B)  chaining 
C)  quadratic probing 
D)  linear probing

Question 20

With a set, the difference and subset operations are not symmetric.

Accepted Answer

A) True 
 B)False

In the hashing implementation of a set, self.index refers to the index of the chain in which the node was just located, or is -1 otherwise.

In the code for the iter method for the ArrayDict class, what is the missing code? def iter(self): Cursor = 0 While cursor < len(self): Yield self.items[cursor].key < missing code >

The AbstractSet class is a subclass of AbstractBag .

In the code for the sub method for the AbstractSet class, what is the missing code? def sub(self, other): Difference = type(self)() For item in self: If not item in other: < missing code > Return difference

A small load factor and an array length that is a prime number increases the chances for a hashing collision.

To reduce the probability of collisions with hashes, you can decrease the array length.

Referring to the keysToIndexes function, what is the result of the following statement? keysToIndexes([ 39, 18, 4, 51, 6, 28 ], 17)

Which of the following is a subset of Set A if Set A is {19 4 26 8}?

Array-based implementations of sets and dictionaries do not perform well.

A set is similar to a bag, but it contains unique data items and additional methods.

In the implementation of the AbstractDict class, which four methods have the same implementation for all dictionaries?

In the code for the init method in the Entry class or a dictionary, what is the missing code? def init(self, key, value): < missing code > Self.value = value

In the Entry class for a dictionary, comparisons are done using the value item in each entry.

Python supports multiple inheritance, so a class can have more than one parent class.

Which method is specific to a set compared to a bag?

The standard Python hash function always returns a unique positive integer.

What is the performance value of the array-based implementations of sets and dictionaries?

For a key value of 93 and a hashing function of key % 46 , what is the index into the array?

In which collision-avoidance hashing strategy are the items stored in an array of linked lists in which each item's key locates the bucket where the item is to be inserted?

With a set, the difference and subset operations are not symmetric.

Basic Python Programming

An Overview of Collections

Searching, Sorting, and Complexity Analysis

Arrays and Linked Structures

Interfaces, Implementations, and Polymorphism

Inheritance and Abstract Classes

Stacks

Queues

Lists

Trees

Graphs

Filters

Exam 11: Sets and Dictionaries

In the hashing implementation of a set, self.index refers to the index of the chain in which the node was just located, or is -1 otherwise.

In the code for the __iter__ method for the ArrayDict class, what is the missing code? def __iter__(self): Cursor = 0 While cursor < len(self): Yield self.items[cursor].key < missing code >

The AbstractSet class is a subclass of AbstractBag .

In the code for the __sub__ method for the AbstractSet class, what is the missing code? def __sub__(self, other): Difference = type(self)() For item in self: If not item in other: < missing code > Return difference

A small load factor and an array length that is a prime number increases the chances for a hashing collision.

To reduce the probability of collisions with hashes, you can decrease the array length.

Referring to the keysToIndexes function, what is the result of the following statement? keysToIndexes([ 39, 18, 4, 51, 6, 28 ], 17)

Which of the following is a subset of Set A if Set A is {19 4 26 8}?

Array-based implementations of sets and dictionaries do not perform well.

A set is similar to a bag, but it contains unique data items and additional methods.

In the implementation of the AbstractDict class, which four methods have the same implementation for all dictionaries?

In the code for the __init__ method in the Entry class or a dictionary, what is the missing code? def __init__(self, key, value): < missing code > Self.value = value

In the Entry class for a dictionary, comparisons are done using the value item in each entry.

Python supports multiple inheritance, so a class can have more than one parent class.

Which method is specific to a set compared to a bag?

The standard Python hash function always returns a unique positive integer.

What is the performance value of the array-based implementations of sets and dictionaries?

For a key value of 93 and a hashing function of key % 46 , what is the index into the array?

In which collision-avoidance hashing strategy are the items stored in an array of linked lists in which each item's key locates the bucket where the item is to be inserted?

With a set, the difference and subset operations are not symmetric.

Basic Python Programming

An Overview of Collections

Searching, Sorting, and Complexity Analysis

Arrays and Linked Structures

Interfaces, Implementations, and Polymorphism

Inheritance and Abstract Classes

Stacks

Queues

Lists

Trees

Graphs

Filters

In the code for the iter method for the ArrayDict class, what is the missing code? def iter(self): Cursor = 0 While cursor < len(self): Yield self.items[cursor].key < missing code >

In the code for the sub method for the AbstractSet class, what is the missing code? def sub(self, other): Difference = type(self)() For item in self: If not item in other: < missing code > Return difference

In the code for the init method in the Entry class or a dictionary, what is the missing code? def init(self, key, value): < missing code > Self.value = value