C++ Chapter 8
You are more likely to find an item by using a binary search than by using a linear search. (T/F)
ANS: False
A selection sort and a binary search can be applied to STL vectors as well as arrays. (T/F)
ANS: True
If you are using the bubble sort algorithm to sort an array in descending order, the smaller values move toward the end. (T/F)
ANS: True
On average, an item is just as likely to be found near the beginning of an array as near the end. (T/F)
ANS: True
The number of comparisons made by a binary search is expressed in powers of two. (T/F)
ANS: True
A linear search can only be implemented with integer values. (T/F)
ANS: False
Before you can perform a bubble sort, the data must be stored in descending order. (T/F)
ANS: False
Before you can perform a selection sort, the data must be stored in ascending order. (T/F)
ANS: False
The bubble sort is an easy way to arrange data in ascending order but it cannot arrange data in descending order. (T/F)
ANS: False
The linear search repeatedly divides the portion of an array being searched in half. (T/F)
ANS: False
Using a linear search to find a value that is stored in the last element of an array that contains 20,000 elements, __________ elements must be compared. a. 20,000 b. only the first two c. only half d. 2,000 e. None of these
a. 20,000
The following is the pseudocode for which type of algorithm? For maxElement = each subscript in the array, from the last to the first For index = 0 To maxElement - 1 If array[index] > array[index + 1] swap array[index] with array[index + 1] End If End For End For a. bubble sort b. binary sort c. bubble search d. selection sort e. None of these
a. bubble sort
Data that is to be sorted in ascending order is ordered a. from lowest value to highest value b. from highest value to lowest value c. with a binary search algorithm d. by identifying the middle value and going up and down from there e. None of these
a. from lowest value to highest value
Assume you have two integer variables, num1 and num2. Which of the following is the correct way to swap the values in these two variables? a. int temp = num1; num2 = num1; num1 = num2; b. int temp = num2; num2 = num1; num1 = temp; c. num1 = num2; num2 = num1; d. int temp = num1; num2 = temp; temp = num2; num1 = temp; e. None of these
b. int temp = num2; num2 = num1; num1 = temp;
The following is the pseudocode for which type of algorithm? Set found to false Set position to -1 Set index to 0 While found is false and index < number of elements If list[index] is equal to search value found = true position = index End If Add 1 to index End While Return position a. linear sort b. linear search c. binary search d. selection sort e. None of these
b. linear search
A __________ algorithm is a method of locating a specific item of information in a larger collection of data. a. sort b. search c. standard d. linear e. None of these
b. search
Algorithms used to arrange random data in some order are __________ algorithms. a. standard search b. sorting c. linear d. binary search e. None of these
b. sorting
The __________ is adequate for searching through small arrays. a. binary search b. the linear search c. unary search d. bubble sort e. None of these
b. the linear search
What, if anything, is wrong with this function? void swap(int num1, int num2) { int temp = num2; num2 = num1; num1 = temp; } a. You must first initalize temp to 0 before using it. b. The variable temp should first be set to num1, not num2. c. The swap function must use reference parameters. d. The last line should be temp = num1. e. Nothing is wrong with this function.
c. The swap function must use reference parameters.
The following is the pseudocode for which type of algorithm? Set first to 0 Set last to the last subscript in the array Set found to false Set position to -1 While found is not true and first is less than or equal to last Set middle to the subscript halfway between array[first] and array[last] If array[middle] equals the desired value Set found to true Set position to middle Else If array[middle] is greater than the desired value Set last to middle - 1 Else Set first to middle + 1 End If End While Return position a. linear sort b. linear search c. binary search d. selection sort e. None of these
c. binary search
A __________ search is more efficient than a __________ search. a. character, string b. integer, double c. binary, linear d. linear, binary e. None of these
c. binary, linear
A(n) __________ search uses a loop to sequentially step through an array. a. binary b. unary c. linear d. relative e. None of these
c. linear
The __________ sort usually performs fewer exchanges than the __________ sort. a. bubble, selection b. binary, linear c. selection, bubble d. ANSI, ASCII e. None of these
c. selection, bubble
The advantage of a linear search is its a. complexity b. efficiency c. simplicity d. speed e. None of these
c. simplicity
What is the output after the following code executes? int numerator = 5; int denominator = 25; int temp = 0; temp = numerator; numerator = denominator; denominator = temp; cout << numerator << "/" << denominator << " = " << (numerator/denominator) << endl; a. 5/25 = numerator/denominator b. 5/25 = 0 c. 5/25 = 0.2 d. 25/5 = 5 e. 25/5 = 25/5
d. 25/5 = 5
When an array is sorted from highest to lowest, it is said to be in a. reverse order b. forward order c. ascending order d. descending order e. None of these
d. descending order
A binary search begins with the __________ element of an array. a. first b. last c. largest d. middle e. None of these
d. middle
The following is the pseudocode for which type of algorithm? For start = each array subscript, from the first to the next-to-last minIndex = start minValue = array[start] For index = start + 1 To size - 1 If array[index] < minValue minValue = array[index] minIndex = index End If End For swap array[minIndex] with array[start] End For a. bubble sort b. binary sort c. bubble search d. selection sort e. None of these
d. selection sort
Array elements must __________ before a binary search can be performed. a. summed b. set to zero c. positive integers d. sorted e. None of these
d. sorted
Regardless of the algorithm being used, a search through an array is always performed a. from lowest to highest element b. from highest to lowest element c. beginning with the middle element d. using a binary search algorithm e. None of these
e. None of these
