Question 1

In a binary search,if the search fails to find the item on the first attempt,then there are 999 elements left to search in an array of 1000 elements.

Accepted Answer

A) True 
 B)False

Question 2

In the bubble sort algorithm,the two arguments sent into the swap module are ___________.

Accepted Answer

A) array[index] and array[index-1] 
B) array[index+1] and array[index-1] 
C) array[index-1] and array[index+1] 
D) array[index-1] and array[index] 
E) None of the above 
A) array[index] and array[index-1] 
B) array[index+1] and array[index-1] 
C) array[index-1] and array[index+1] 
D) array[index-1] and array[index] 
E) None of the above

Question 3

Which searching algorithm requires the array to be ordered?

Accepted Answer

A) Sequential 
B) Binary 
C) Linear 
D) Parallel 
E) None of the above 
A) Sequential 
B) Binary 
C) Linear 
D) Parallel 
E) None of the above

Question 4

What does the variable middle represent in a binary search algorithm?

Accepted Answer

A) Subscript of the midpoint 
B) Middle value in the array 
C) Middle value in the portion to be searched 
D) The average of two values 
E) None of the above 
A) Subscript of the midpoint 
B) Middle value in the array 
C) Middle value in the portion to be searched 
D) The average of two values 
E) None of the above

Question 5

In a selection sort,which variable holds the subscript of the element with the smallest value found in the scanned area of the array?

Accepted Answer

A) minIndex 
B) minValue 
C) startScan 
D) SIZE 
E) None of the above 
A) minIndex 
B) minValue 
C) startScan 
D) SIZE 
E) None of the above

Question 6

To order an array of strings in alphabetic order,the sorting algorithm should be structured for ____________ order.

Accepted Answer

A) alphabetic 
B) numeric 
C) ascending 
D) descending 
E) None of the above 
A) alphabetic 
B) numeric 
C) ascending 
D) descending 
E) None of the above

Question 7

When the elements in an array are stored from lowest to highest,the array is sorted in __________ order.

Accepted Answer

A) Ascending 
B) Descending 
C) Numeric 
D) Alphabetic 
E) None of the above 
A) Ascending 
B) Descending 
C) Numeric 
D) Alphabetic 
E) None of the above

Question 8

In a selection sort algorithm,the variable minValue holds the smallest value found in the scanned area of the array.

Accepted Answer

A) True 
 B)False

Question 9

Which statement is true after the execution of the following statements?
Set x = y
Set y = x

Accepted Answer

A) x and y contain their original values 
B) x and y swapped their values 
C) x contains the value in y and y stayed the same 
D) y contains the value in x and x stayed the same 
E) None of the above 
A) x and y contain their original values 
B) x and y swapped their values 
C) x contains the value in y and y stayed the same 
D) y contains the value in x and x stayed the same 
E) None of the above

Question 10

The bubble sort is limited to arranging data only in acceding order.

Accepted Answer

The answer of The bubble sort is limited to arranging...

Question 11

The sequential search algorithm is simple and most efficient to use with a large data array.

Accepted Answer

A) True 
 B)False

Question 12

In a selection sort,the minValue is set to element _____ in the first iteration of the outer loop.

Accepted Answer

The answer of In a selection sort,the minValue is set...

Question 13

In a selection sort,the first step is to move the smallest value in the array to element _______,in order to sort the array in ascending order.

Accepted Answer

The answer of In a selection sort,the first step is...

Question 14

All sorting algorithms contain a group of statements that swap values in array elements.

Accepted Answer

A) True 
 B)False

Question 15

The data in an array can be sorted in either ascending or descending order.

Accepted Answer

A) True 
 B)False

Question 16

In the bubble sort algorithm,the movement of the sorted values is commonly described as seeming to __________ toward the end of the array.

Accepted Answer

The answer of In the bubble sort algorithm,the movement of...

Question 17

In the swap module,the third variable is declared as a __________ variable.

Accepted Answer

A) Global 
B) Reference 
C) Local 
D) Constant 
E) None of the above 
A) Global 
B) Reference 
C) Local 
D) Constant 
E) None of the above

Question 18

The biggest advantage of the bubble sort algorithm is that values move only by one element at a time toward their final destination in the array.

Accepted Answer

A) True 
 B)False

Question 19

If the values in an array are sorted in ___________ order,then they are stored from highest to lowest.

Accepted Answer

The answer of If the values in an array are...

Question 20

Which search algorithm uses three variables to mark positions within the array as it searches for the searchValue?

Accepted Answer

A) Sequential 
B) Binary 
C) Parallel 
D) Linear 
E) None of the above 
A) Sequential 
B) Binary 
C) Parallel 
D) Linear 
E) None of the above

In a binary search,if the search fails to find the item on the first attempt,then there are 999 elements left to search in an array of 1000 elements.

In the bubble sort algorithm,the two arguments sent into the swap module are ___________.

Which searching algorithm requires the array to be ordered?

What does the variable middle represent in a binary search algorithm?

In a selection sort,which variable holds the subscript of the element with the smallest value found in the scanned area of the array?

To order an array of strings in alphabetic order,the sorting algorithm should be structured for ____________ order.

When the elements in an array are stored from lowest to highest,the array is sorted in __________ order.

In a selection sort algorithm,the variable minValue holds the smallest value found in the scanned area of the array.

Which statement is true after the execution of the following statements? Set x = y Set y = x

The bubble sort is limited to arranging data only in acceding order.

The sequential search algorithm is simple and most efficient to use with a large data array.

In a selection sort,the minValue is set to element _____ in the first iteration of the outer loop.

In a selection sort,the first step is to move the smallest value in the array to element _______,in order to sort the array in ascending order.

All sorting algorithms contain a group of statements that swap values in array elements.

The data in an array can be sorted in either ascending or descending order.

In the bubble sort algorithm,the movement of the sorted values is commonly described as seeming to __________ toward the end of the array.

In the swap module,the third variable is declared as a __________ variable.

The biggest advantage of the bubble sort algorithm is that values move only by one element at a time toward their final destination in the array.

If the values in an array are sorted in ___________ order,then they are stored from highest to lowest.

Which search algorithm uses three variables to mark positions within the array as it searches for the searchValue?

Introduction to Computers and Programming

Input, processing, and Output

Modules

Decision Structures and Boolean Logic

Repetition Structures

Functions

Input Validation

Arrays

Files

Menu-Driven Programs

Text Processing

Recursion

Object-Oriented Programming

Gui Applications and Event-Driven Programming

Filters

Exam 9: Sorting and Searching Arrays

In a binary search,if the search fails to find the item on the first attempt,then there are 999 elements left to search in an array of 1000 elements.

In the bubble sort algorithm,the two arguments sent into the swap module are ___________.

Which searching algorithm requires the array to be ordered?

What does the variable middle represent in a binary search algorithm?

In a selection sort,which variable holds the subscript of the element with the smallest value found in the scanned area of the array?

To order an array of strings in alphabetic order,the sorting algorithm should be structured for ____________ order.

When the elements in an array are stored from lowest to highest,the array is sorted in __________ order.

In a selection sort algorithm,the variable minValue holds the smallest value found in the scanned area of the array.

Which statement is true after the execution of the following statements? Set x = y Set y = x

The bubble sort is limited to arranging data only in acceding order.

The sequential search algorithm is simple and most efficient to use with a large data array.

In a selection sort,the minValue is set to element _____ in the first iteration of the outer loop.

In a selection sort,the first step is to move the smallest value in the array to element _______,in order to sort the array in ascending order.

All sorting algorithms contain a group of statements that swap values in array elements.

The data in an array can be sorted in either ascending or descending order.

In the bubble sort algorithm,the movement of the sorted values is commonly described as seeming to __________ toward the end of the array.

In the swap module,the third variable is declared as a __________ variable.

The biggest advantage of the bubble sort algorithm is that values move only by one element at a time toward their final destination in the array.

If the values in an array are sorted in ___________ order,then they are stored from highest to lowest.

Which search algorithm uses three variables to mark positions within the array as it searches for the searchValue?

Introduction to Computers and Programming

Input, processing, and Output

Modules

Decision Structures and Boolean Logic

Repetition Structures

Functions

Input Validation

Arrays

Files

Menu-Driven Programs

Text Processing

Recursion

Object-Oriented Programming

Gui Applications and Event-Driven Programming

Filters