Question 1

Before you can perform a selection sort, the data must be stored in ascending order.

Accepted Answer

A) True 
 B)False  False

Question 2

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

Accepted Answer

A)   linear sort
B)   linear search
C)   binary search
D)   selection sort
E)   None of these C

Question 3

Array elements must __________ before a binary search can be performed.

Accepted Answer

A)   summed
B)   set to zero
C)   positive integers
D)   sorted
E)   None of these D

Question 4

The number of comparisons made by a binary search is expressed in powers of two.

Accepted Answer

A) True 
 B)False

Question 5

On average, an item is just as likely to be found near the beginning of an array as near the end.

Accepted Answer

A) True 
 B)False

Question 6

The __________ sort usually performs fewer exchanges than the __________ sort.

Accepted Answer

A)   bubble, selection
B)   binary, linear
C)   selection, bubble
D)   ANSI, ASCII
E)   None of these

Question 7

A __________ algorithm is a method of locating a specific item of information in a larger collection of data.

Accepted Answer

A)   sort
B)   search
C)   standard
D)   linear
E)   None of these

Question 8

The advantage of a linear search is its

Accepted Answer

A)   complexity
B)   efficiency
C)   simplicity
D)   speed
E)   None of these

Question 9

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?

Accepted Answer

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

Question 10

When an array is sorted from highest to lowest, it is said to be in

Accepted Answer

A)   reverse order
B)   forward order
C)   ascending order
D)   descending order
E)   None of these

Question 11

Before you can perform a bubble sort, the data must be stored in descending order.

Accepted Answer

A) True 
 B)False

Question 12

A(n) __________ search uses a loop to sequentially step through an array.

Accepted Answer

A)   binary
B)   unary
C)   linear
D)   relative
E)   None of these

Question 13

A __________ search is more efficient than a __________ search.

Accepted Answer

A)   character, string
B)   integer, double
C)   binary, linear
D)   linear, binary
E)   None of these

Question 14

The following function should swap the values contained in two integer variables, num1 and num2. What, if anything, is wrong with this function?
Void swap(int num1, int num2)
{
Int temp = num2;
Num2 = num1;
Num1 = temp;
}

Accepted Answer

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.

Question 15

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

Accepted Answer

A)   bubble sort
B)   binary sort
C)   bubble search
D)   selection sort
E)   None of these

Question 16

Algorithms used to arrange random data in some order are __________ algorithms.

Accepted Answer

A)   standard search
B)   sorting
C)   linear
D)   binary search
E)   None of these

Question 17

The bubble sort is an easy way to arrange data in ascending order but it cannot arrange data in descending order.

Accepted Answer

A) True 
 B)False

Question 18

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

Accepted Answer

A)   bubble sort
B)   binary sort
C)   bubble search
D)   selection sort
E)   None of these

Question 19

The __________ is adequate for searching through small arrays.

Accepted Answer

A)   binary search
B)   the linear search
C)   unary search
D)   bubble sort
E)   None of these

Question 20

A linear search can only be implemented with integer values.

Accepted Answer

A) True 
 B)False

Exam 8: Searching and Sorting Arrays

Before you can perform a selection sort, the data must be stored in ascending order.

Array elements must __________ before a binary search can be performed.

The number of comparisons made by a binary search is expressed in powers of two.

On average, an item is just as likely to be found near the beginning of an array as near the end.

The sort usually performs fewer exchanges than the sort.

A __________ algorithm is a method of locating a specific item of information in a larger collection of data.

The advantage of a linear search is its

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?

When an array is sorted from highest to lowest, it is said to be in

Before you can perform a bubble sort, the data must be stored in descending order.

A(n) __________ search uses a loop to sequentially step through an array.

A search is more efficient than a search.

The following function should swap the values contained in two integer variables, num1 and num2. What, if anything, is wrong with this function? Void swap(int num1, int num2) { Int temp = num2; Num2 = num1; Num1 = temp; }

Algorithms used to arrange random data in some order are __________ algorithms.

The bubble sort is an easy way to arrange data in ascending order but it cannot arrange data in descending order.

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

The __________ is adequate for searching through small arrays.

A linear search can only be implemented with integer values.