Question 1

In insertion sort, during the sorting phase the array containing the list is divided into three sublists.

Accepted Answer

A) True 
 B)False  False

Question 2

Selection sort swaps the smallest element in the unsorted portion of the list to a new position.

Accepted Answer

A) True 
 B)False  True

Question 3

In selection sort, initially, the entire list, that is, list[0]...list[listLength], is the unsorted list.

Accepted Answer

A) True 
 B)False  False

Question 4

-If the list in the accompanying figure was to be searched using a sequential search on an unordered list, how many key comparisons would be made to find the number 44?

Accepted Answer

A)   1
B)   3
C)   5
D)   6

Question 5

If the list in the accompanying figure was sorted, what would be the middle element?

Accepted Answer

A)   7
B)   16
C)   24
D)   45

Question 6

Consider the following list. list = {5, 11, 25, 28, 45, 78, 100, 120, 125}; Suppose that binary search as discussed in the book is used to determine whether 28 is in list. What are the values of first and last when the while loop in the body of the binarySearch method terminates?

Accepted Answer

A)   first = 3, last = 3
B)   first = 0, last = 3
C)   first = 2, last = 4
D)   None of these

Question 7

On average, the number of comparisons made by a sequential search is equal to one-third the size of the list.

Accepted Answer

A) True 
 B)False

Question 8

-If the list in the accompanying figure was to be searched for the number 44 using a binary search, how many key comparisons would have to be made?

Accepted Answer

A)   1
B)   3
C)   5
D)   7

Question 9

-Based on the accompanying figure, in a sequential search, what is the minimum number of comparisons that have to be made if the search item was 10?

Accepted Answer

A)   0
B)   1
C)   7
D)   8

Question 10

In a sequential search, you search an array starting from the middle component.

Accepted Answer

A) True 
 B)False

Question 11

In the binary search algorithm, two key comparisons are made through every iteration of the loop.

Accepted Answer

A) True 
 B)False

Question 12

-What is the minimum number of comparisons that have to be made to find 18 using a sequential search on the list shown in the accompanying figure?

Accepted Answer

A)   1
B)   2
C)   3
D)   4

Question 13

What is the maximum number of key comparisons made when searching a list L of length n for an item using a binary search?

Accepted Answer

A)   log n
B)   2 * log2n + 2
C)   2
D)   n

Question 14

Suppose that L is a sorted list of length 1000. To determine whether an item is in L, the maximum number of comparisons executed by the binary search algorithm, as discussed in this book, is ____.

Accepted Answer

A)   1
B)   42
C)   500
D)   None of these

Question 15

-If a binary search was used on the list in the accompanying figure, which element would the search element be compared to first?

Accepted Answer

A)   4
B)   35
C)   44
D)   98

Question 16

Consider the following list. list = {5, 11, 25, 28, 45, 78, 100, 120, 125}; Suppose that binary search as discussed in the book is used to determine whether 110 is in list. Exactly how many key comparisons are executed by binary search?

Accepted Answer

A)   3
B)   5
C)   8
D)   12

Question 17

-In a sequential search, how many key comparisons would have to be made on the list in the accompanying figure to find the number 5?

Accepted Answer

A)   4
B)   5
C)   7
D)   8

Question 18

Suppose that you have the following list. int[] list = {1, 3, 5, 7, 9, 11, 13, 15, 17}; Further assume that binary search is used to determine whether 8 is in list. When the loop terminates, the value of the index variable first is 1.

Accepted Answer

A) True 
 B)False

Question 19

A sequential search is most efficient for large lists.

Accepted Answer

A) True 
 B)False

Question 20

A sequential search is faster than a binary search on sorted lists.

Accepted Answer

A) True 
 B)False

Exam 14: Searching and Sorting

In insertion sort, during the sorting phase the array containing the list is divided into three sublists.

Selection sort swaps the smallest element in the unsorted portion of the list to a new position.

In selection sort, initially, the entire list, that is, list[0]...list[listLength], is the unsorted list.

-If the list in the accompanying figure was to be searched using a sequential search on an unordered list, how many key comparisons would be made to find the number 44?

If the list in the accompanying figure was sorted, what would be the middle element?

Consider the following list. list = {5, 11, 25, 28, 45, 78, 100, 120, 125}; Suppose that binary search as discussed in the book is used to determine whether 28 is in list. What are the values of first and last when the while loop in the body of the binarySearch method terminates?

On average, the number of comparisons made by a sequential search is equal to one-third the size of the list.

-If the list in the accompanying figure was to be searched for the number 44 using a binary search, how many key comparisons would have to be made?

-Based on the accompanying figure, in a sequential search, what is the minimum number of comparisons that have to be made if the search item was 10?

In a sequential search, you search an array starting from the middle component.

In the binary search algorithm, two key comparisons are made through every iteration of the loop.

-What is the minimum number of comparisons that have to be made to find 18 using a sequential search on the list shown in the accompanying figure?

What is the maximum number of key comparisons made when searching a list L of length n for an item using a binary search?

Suppose that L is a sorted list of length 1000. To determine whether an item is in L, the maximum number of comparisons executed by the binary search algorithm, as discussed in this book, is ____.

-If a binary search was used on the list in the accompanying figure, which element would the search element be compared to first?

Consider the following list. list = {5, 11, 25, 28, 45, 78, 100, 120, 125}; Suppose that binary search as discussed in the book is used to determine whether 110 is in list. Exactly how many key comparisons are executed by binary search?

-In a sequential search, how many key comparisons would have to be made on the list in the accompanying figure to find the number 5?

Suppose that you have the following list. int[] list = {1, 3, 5, 7, 9, 11, 13, 15, 17}; Further assume that binary search is used to determine whether 8 is in list. When the loop terminates, the value of the index variable first is 1.

A sequential search is most efficient for large lists.

A sequential search is faster than a binary search on sorted lists.