Question 1

Which of the following sorting algorithms is the least efficient?

Accepted Answer

A) Bubble sort 
B) Insertion sort 
C) Selection sort 
D) All of the above 
E) None of the above 
A) Bubble sort 
B) Insertion sort 
C) Selection sort 
D) All of the above 
E) None of the above A

Question 2

For an array of n items,the average number of comparisons in a sequential search is _______.

Accepted Answer

n/2

Question 3

In the bubble sort algorithm,the maxElement variable will hold the _______ of the last element that is to be compared to its immediate neighbor.

Accepted Answer

subscript

Question 4

Swapping the contents of two variables requires a third variable that can serve as a temporary storage location.

Accepted Answer

A) True 
 B)False

Question 5

The advantage of the _________ search is its simplicity.

Accepted Answer

The answer of The advantage of the _________ search is...

Question 6

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

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 7

Which sorting algorithm moves elements to their final sorted position in the array?

Accepted Answer

A) Bubble 
B) Selection 
C) Insertion 
D) Hash 
E) None of the above 
A) Bubble 
B) Selection 
C) Insertion 
D) Hash 
E) None of the above

Question 8

Which of the following search algorithms should be used on large arrays if speed is important?

Accepted Answer

A) Binary 
B) Sequential 
C) Bubble 
D) Selection 
E) Insertion 
A) Binary 
B) Sequential 
C) Bubble 
D) Selection 
E) Insertion

Question 9

When values in an array need to be swapped,the array and the size of the array have to be sent to the swap module.

Accepted Answer

A) True 
 B)False

Question 10

In a sorting algorithm,the sort order can be changed by changing the ________________ operator.

Accepted Answer

The answer of In a sorting algorithm,the sort order can...

Question 11

In a binary search,what is the maximum number of comparisons that need to be performed if the array contained 1000 elements?

Accepted Answer

A) 1000 
B) 500 
C) 250 
D) 100 
E) None of the above 
A) 1000 
B) 500 
C) 250 
D) 100 
E) None of the above

Question 12

When placing the elements in an array in descending order,the __________ sort begins by finding and placing the largest value in element 0.

Accepted Answer

The answer of When placing the elements in an array...

Question 13

Which of the following is a sorting algorithm?

Accepted Answer

A) Bubble sort 
B) Selection sort 
C) Insertion sort 
D) All of the above 
E) None of the above 
A) Bubble sort 
B) Selection sort 
C) Insertion sort 
D) All of the above 
E) None of the above

Question 14

When using a module to swap the values in two variables,the arguments must be passed into __________ parameters in the module.

Accepted Answer

The answer of When using a module to swap the...

Question 15

Which sorting algorithm sorts the first two elements of an array before inserting the remaining elements into that sorted part of the array?

Accepted Answer

A) Bubble 
B) Selection 
C) Insertion 
D) Hash 
E) None of the above 
A) Bubble 
B) Selection 
C) Insertion 
D) Hash 
E) None of the above

Question 16

In a sequential search,each element is compared to the searchValue and the search stops when the value is found or the end of the array is encountered.

Accepted Answer

A) True 
 B)False

Question 17

The _________ search algorithm locates an item in an array by repeatedly dividing the array in half.

Accepted Answer

The answer of The _________ search algorithm locates an item...

Question 18

For an array of n items,the maximum number of comparisons in a sequential search is ______.

Accepted Answer

The answer of For an array of n items,the maximum...

Question 19

As the __________sorting algorithm makes passes through and compares the elements of the array,certain values move toward the end of the array with each pass.

Accepted Answer

A) Bubble 
B) Selection 
C) Insertion 
D) Hash 
E) None of the above 
A) Bubble 
B) Selection 
C) Insertion 
D) Hash 
E) None of the above

Question 20

Computer programming languages are only able to perform sort algorithms on numeric arrays.

Accepted Answer

A) True 
 B)False

Which of the following sorting algorithms is the least efficient?

For an array of n items,the average number of comparisons in a sequential search is _______.

In the bubble sort algorithm,the maxElement variable will hold the _______ of the last element that is to be compared to its immediate neighbor.

Swapping the contents of two variables requires a third variable that can serve as a temporary storage location.

The advantage of the _________ search is its simplicity.

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

Which sorting algorithm moves elements to their final sorted position in the array?

Which of the following search algorithms should be used on large arrays if speed is important?

When values in an array need to be swapped,the array and the size of the array have to be sent to the swap module.

In a sorting algorithm,the sort order can be changed by changing the ________________ operator.

In a binary search,what is the maximum number of comparisons that need to be performed if the array contained 1000 elements?

When placing the elements in an array in descending order,the __________ sort begins by finding and placing the largest value in element 0.

Which of the following is a sorting algorithm?

When using a module to swap the values in two variables,the arguments must be passed into __________ parameters in the module.

Which sorting algorithm sorts the first two elements of an array before inserting the remaining elements into that sorted part of the array?

In a sequential search,each element is compared to the searchValue and the search stops when the value is found or the end of the array is encountered.

The _________ search algorithm locates an item in an array by repeatedly dividing the array in half.

For an array of n items,the maximum number of comparisons in a sequential search is ______.

As the __________sorting algorithm makes passes through and compares the elements of the array,certain values move toward the end of the array with each pass.

Computer programming languages are only able to perform sort algorithms on numeric arrays.

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

Which of the following sorting algorithms is the least efficient?

For an array of n items,the average number of comparisons in a sequential search is _______.

In the bubble sort algorithm,the maxElement variable will hold the _______ of the last element that is to be compared to its immediate neighbor.

Swapping the contents of two variables requires a third variable that can serve as a temporary storage location.

The advantage of the _________ search is its simplicity.

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

Which sorting algorithm moves elements to their final sorted position in the array?

Which of the following search algorithms should be used on large arrays if speed is important?

When values in an array need to be swapped,the array and the size of the array have to be sent to the swap module.

In a sorting algorithm,the sort order can be changed by changing the ________________ operator.

In a binary search,what is the maximum number of comparisons that need to be performed if the array contained 1000 elements?

When placing the elements in an array in descending order,the __________ sort begins by finding and placing the largest value in element 0.

Which of the following is a sorting algorithm?

When using a module to swap the values in two variables,the arguments must be passed into __________ parameters in the module.

Which sorting algorithm sorts the first two elements of an array before inserting the remaining elements into that sorted part of the array?

In a sequential search,each element is compared to the searchValue and the search stops when the value is found or the end of the array is encountered.

The _________ search algorithm locates an item in an array by repeatedly dividing the array in half.

For an array of n items,the maximum number of comparisons in a sequential search is ______.

As the __________sorting algorithm makes passes through and compares the elements of the array,certain values move toward the end of the array with each pass.

Computer programming languages are only able to perform sort algorithms on numeric arrays.

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