computer science illuminated, 3rd edition - kent.docVIP

Programming Set 4 Part A. Search and Sorting Algorithms (25 points) True / False (each question is 1 point) True or False? A selection sort compares adjacent elements and swaps them if they are in the wrong order. False True or False? Each pass of a bubble sort selects one item and puts it in its final sorted position. False True or False? The Quicksort algorithm separates the items to be sorted into two sections based on a particular split value. True True or False? A sequential search begins the search process in the middle of the list. False True or False? A binary search uses a string of bits (binary digits) to filter the search items while looking for an item. False True or False? A binary search eliminates large portions of the data on each comparison. True True or False? A binary search requires that the data be sorted. True Multiple Choice (each question is 1 point) Which of the following requires the use of a splitting value? selection sort quicksort bubble sort binary search sequential search B Which of the following eliminates a large portion of the data with each comparison? selection sort quicksort bubble sort binary search sequential search D How many comparisons will be needed using a sequential search to find the value 69 in the following array? [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] 14 27 29 38 42 55 57 61 64 69 77 79 84 1 2 9 10 12 D How many comparisons will be needed using a binary search to find the value 69 in the following array? [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] 14 27 29 38 42 55 57 61 64 69 77 79 84 1 2 9 10 12 B Short Answer (each question is 2 points) Show the state of the following array after the outer loop of the selection sort algorithm has executed two times. [0] [1] [2] [3] [4] [5] 19 23 2 4 99 1 [0] [1] [2] [3] [4] [5] 1 2 23 4 99 19 Show the state of the following array after the outer loop of the bubble sort algorithm has executed three times. [0] [1] [2] [3] [4] [5] 12 1 9