Question 1

What happens when two keys map to the same index after a hashing function has been applied?

Accepted Answer

A)  the array is lengthened 
B)  a collision occurs 
C)  the second item is mapped to the next cell 
D)  the hash is reapplied with a random value 
A)  the array is lengthened 
B)  a collision occurs 
C)  the second item is mapped to the next cell 
D)  the hash is reapplied with a random value

Question 2

The dictionary constructor has two optional collection arguments: a collection of keys and a collection of corresponding values.

Accepted Answer

A) True 
 B)False

Question 3

The simplest implementations of sets are subclasses of which other class?

Accepted Answer

A)  bags 
B)  queues 
C)  stacks 
D)  lists 
A)  bags 
B)  queues 
C)  stacks 
D)  lists

Question 4

Much like a list, a set contains items that are in a particular order.

Accepted Answer

A) True 
 B)False

Question 5

Two keys that hash to the same index is called a collision.

Accepted Answer

A) True 
 B)False

Question 6

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

Accepted Answer

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

Question 7

If S1 and s2 are sets, the expression s1.issubset(s2) returns True if s2 is a subset of s1 .

Accepted Answer

A) True 
 B)False

Question 8

The data in sets and dictionaries are ordered by position by default.

Accepted Answer

A) True 
 B)False

Question 9

What strategy for implementing sets attempts to approximate random access into an array for insertions, removals, and searches?

Accepted Answer

A)  indexing 
B)  linking 
C)  hashing 
D)  keying 
A)  indexing 
B)  linking 
C)  hashing 
D)  keying

Question 10

What is the value of set S after the following operations?
S = set([ 3, 9, 6 ])
S.add(6)
S.add(4)
S.remove(6)

Accepted Answer

A)  {3 9 6 4} 
B)  {3 9 4} 
C)  {3 9 6} 
D)  {3 4 6 9} 
A)  {3 9 6 4} 
B)  {3 9 4} 
C)  {3 9 6} 
D)  {3 4 6 9}

What happens when two keys map to the same index after a hashing function has been applied?

The dictionary constructor has two optional collection arguments: a collection of keys and a collection of corresponding values.

The simplest implementations of sets are subclasses of which other class?

Much like a list, a set contains items that are in a particular order.

Two keys that hash to the same index is called a collision.

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

If S1 and s2 are sets, the expression s1.issubset(s2) returns True if s2 is a subset of s1 .

The data in sets and dictionaries are ordered by position by default.

What strategy for implementing sets attempts to approximate random access into an array for insertions, removals, and searches?

What is the value of set S after the following operations? S = set([ 3, 9, 6 ]) S.add(6) S.add(4) S.remove(6)

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

What happens when two keys map to the same index after a hashing function has been applied?

The dictionary constructor has two optional collection arguments: a collection of keys and a collection of corresponding values.

The simplest implementations of sets are subclasses of which other class?

Much like a list, a set contains items that are in a particular order.

Two keys that hash to the same index is called a collision.

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

If S1 and s2 are sets, the expression s1.issubset(s2) returns True if s2 is a subset of s1 .

The data in sets and dictionaries are ordered by position by default.

What strategy for implementing sets attempts to approximate random access into an array for insertions, removals, and searches?

What is the value of set S after the following operations? S = set([ 3, 9, 6 ]) S.add(6) S.add(4) S.remove(6)

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