1 The run-time complexity of the union, intersection, and difference methods for list-based sets is a O(n) b O(n log n) c O(n2) 2 The intersection of the two sets {A, B, C} and {B, C, D} is a {A, B,...

1 The run-time complexity of the union, intersection, and difference methods for list-based sets is

a O(n)

b O(n log n)

c O(n2)

2 The intersection of the two sets {A, B, C} and {B, C, D} is

a {A, B, C, D}

b {B, C}

3 The load factor of an array of 10 positions that contains 3 items is

a 3.0

b 0.33

c 0.67

4 The linear method of resolving collisions

a searches for the next available empty position in the array

b selects a position at random until the position is empty

5 When the load factor is very small, a hashing implementation of a set or

a dictionary provides

a logarithmic-time access

b constant-time access