Question 1

A binary search can be performed on both sorted and unsorted lists.

Accepted Answer

A) True 
 B)False

Question 2

Consider the following list. list = {24, 20, 10, 75, 70, 18, 60, 35} Suppose that list is sorted using the insertion sort algorithm as discussed in the book. What is the resulting list after two passes of the sorting phase; that is, after three iterations of the for loop?

Accepted Answer

A)  list = {10, 18, 20, 24, 75, 70, 60, 35} 
B)  list = {10, 20, 24, 75, 70, 18, 60, 35} 
C)  list = {10, 18, 20, 24, 35, 70, 60, 75} 
D)  list = {10, 20, 20, 18, 35, 70, 60, 75}

Question 3

In a sequential search, the array must be sorted.

Accepted Answer

A) True 
 B)False

Question 4

Which technique does a binary search use to find an element in a list?

Accepted Answer

A)  divide and conquer 
B)  row and column 
C)  first to last 
D)  hunt and peck

Question 5

A binary search starts by comparing the search item to the first item in the list.

Accepted Answer

A) True 
 B)False

Question 6

The selection sort algorithm repeatedly moves the smallest element from the unsorted list to the top of the unsorted list.

Accepted Answer

A) True 
 B)False

Question 7

Selection sort uses nested for loops.

Accepted Answer

A) True 
 B)False

Question 8

Consider the following list. list = {20, 10, 17, 2, 18, 35, 30, 90, 48, 47}; Suppose that sequential search as discussed in the book is used to determine whether 95 is in list. Exactly how many key comparisons are executed by the sequential search algorithm?

Accepted Answer

A)  1 
B)  8 
C)  9 
D)  10

Question 9

A selection sort always starts with the middle element of the list.

Accepted Answer

A) True 
 B)False

Question 10

Consider the following list. list = {20, 10, 17, 2, 18, 35, 30, 90, 48, 47}; Suppose that sequential search as discussed in the book is used to determine whether 2 is in list. Exactly how many key comparisons are executed by the sequential search algorithm?

Accepted Answer

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

Question 11

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. Exactly how many key comparisons are executed by binary search?

Accepted Answer

A)  6 
B)  7 
C)  9 
D)  10

Question 12

In general, if L is a sorted list of size n, to determine whether an element is in L, the binary search makes at most 2 * log2n + 2 key (item) comparisons.

Accepted Answer

A) True 
 B)False

Question 13

Insertion sort makes approximately the same number of key comparisons as item assignments.

Accepted Answer

A) True 
 B)False

Question 14

The insertion sort algorithm sorts a list by repeatedly inserting an element in its proper place into a sorted sublist.

Accepted Answer

A) True 
 B)False

Question 15

Suppose that L is a list of length 100. In a successful search, to determine whether an item is in L, on average the number of key comparisons executed by the sequential search algorithm, as discussed in this book, is ____.

Accepted Answer

A)  49 
B)  50 
C)  51 
D)  100

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. What are the values of first and last when the while loop, in the body of the binarySearch method, terminates?

Accepted Answer

A)  first = 6, last = 6 
B)  first = 6, last = 7 
C)  first = 7, last = 6 
D)  None of these

Question 17

Consider the following list. list = {24, 20, 10, 75, 70, 18, 60, 35} Suppose that list is sorted using the selection sort algorithm as discussed in the book. What is the resulting list after two passes of the sorting phase; that is, after two iterations of the outer for loop?

Accepted Answer

A)  list = {10, 18, 24, 20, 75, 70, 60, 35} 
B)  list = {10, 18, 20, 24, 75, 70, 60, 35} 
C)  list = {10, 18, 24, 75, 70, 20, 60, 35} 
D)  list = {10, 20, 24, 75, 70, 20, 60, 35}

Question 18

To design a general-purpose sort method, sortList, to sort a list, which of the following must be parameters of the method sortList. (i) The array containing the list (ii) The length of the list (iii) A boolean variable indicating whether the sort was successful

Accepted Answer

A)  (i) 
B)  (ii) 
C)  (i) and (ii) 
D)  (i), (ii), and (iii)

Question 19

Why can't a binary search be used on the list as it appears in the accompanying figure?

Accepted Answer

A)  Because the list is too big 
B)  Because the list is not sorted 
C)  Because it is a list of integers 
D)  A binary search can be used on the list

Question 20

Key comparisons are also called item comparisons.

Accepted Answer

A) True 
 B)False

Exam 14: Searching and Sorting

A binary search can be performed on both sorted and unsorted lists.

Consider the following list. list = {24, 20, 10, 75, 70, 18, 60, 35} Suppose that list is sorted using the insertion sort algorithm as discussed in the book. What is the resulting list after two passes of the sorting phase; that is, after three iterations of the for loop?

In a sequential search, the array must be sorted.

Which technique does a binary search use to find an element in a list?

A binary search starts by comparing the search item to the first item in the list.

The selection sort algorithm repeatedly moves the smallest element from the unsorted list to the top of the unsorted list.

Selection sort uses nested for loops.

Consider the following list. list = {20, 10, 17, 2, 18, 35, 30, 90, 48, 47}; Suppose that sequential search as discussed in the book is used to determine whether 95 is in list. Exactly how many key comparisons are executed by the sequential search algorithm?

A selection sort always starts with the middle element of the list.

Consider the following list. list = {20, 10, 17, 2, 18, 35, 30, 90, 48, 47}; Suppose that sequential search as discussed in the book is used to determine whether 2 is in list. Exactly how many key comparisons are executed by the sequential search algorithm?

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. Exactly how many key comparisons are executed by binary search?

In general, if L is a sorted list of size n, to determine whether an element is in L, the binary search makes at most 2 * log₂n + 2 key (item) comparisons.

Insertion sort makes approximately the same number of key comparisons as item assignments.

The insertion sort algorithm sorts a list by repeatedly inserting an element in its proper place into a sorted sublist.

Suppose that L is a list of length 100. In a successful search, to determine whether an item is in L, on average the number of key comparisons executed by the sequential search algorithm, as discussed in this book, is ____.

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. What are the values of first and last when the while loop, in the body of the binarySearch method, terminates?

Consider the following list. list = {24, 20, 10, 75, 70, 18, 60, 35} Suppose that list is sorted using the selection sort algorithm as discussed in the book. What is the resulting list after two passes of the sorting phase; that is, after two iterations of the outer for loop?

To design a general-purpose sort method, sortList, to sort a list, which of the following must be parameters of the method sortList. (i) The array containing the list (ii) The length of the list (iii) A boolean variable indicating whether the sort was successful

Why can't a binary search be used on the list as it appears in the accompanying figure?

Key comparisons are also called item comparisons.