1. Resolving collisions by using buckets that are linked chains is called a.. separate chaining b, bucket chaining c. st resolution d. joint chaining 2. The most efficient approach to dealing with a gap left in an array after removing an entry from a bag is to a. replace the entry being removed with the last entry in the array and replace the last entry with null b. replace the entry being removed with the first entry in the array and replace the first entry with null c. shift subsequent entries and replace the duplicate reference to the last entry with null d. replace the entry being removed with null 3. Which of the following is an advantage of using an array to implement the ADT bag? a. adding an entry to a bag is fast b. removing a particular entry requires time to locate the entry c. increasing the size of the array requires time to copy its entries d. the client has control over the size of the bag 4. Which of these statements about binary search is true? a. Searching a sorted array is O( n). b. Searching an unsorted array is O(log n). c. Searching a sorted linked list is as efficient as searching a sorted array. d. on each pass half the remaining elements in the list are eliminated 5. The method for removing an item from the front of a queue is called dequeue b. enqueue c. get Front d. none of the above 6. Given a linked list containing the following values: first-> 5-> 10. 15 20 null, which of the following best describes what needs to happen when 10 is deleted from the list? a. The node containing 5 must be changed to point to the node which contains 15. Then the node containing 10 can be deleted