Question 1

A binary search begins with the __________ element of an array.

Accepted Answer

A)  first 
B)  last 
C)  largest 
D)  middle 
E)  None of these 
A)  first 
B)  last 
C)  largest 
D)  middle 
E)  None of these

Question 2

Regardless of the algorithm being used, a search through an array is always performed

Accepted Answer

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 
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

Question 3

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

Accepted Answer

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

Question 4

You are more likely to find an item by using a binary search than by using a linear search.

Accepted Answer

A) True 
 B)False

Question 5

A selection sort and a binary search can be applied to STL vectors as well as arrays.

Accepted Answer

A) True 
 B)False

Question 6

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;

Accepted Answer

A)  5/25 = numerator/denominator 
B)  5/25 = 0 
C)  5/25 = 0.2 
D)  25/5 = 5 
E)  25/5 = 25/5 
A)  5/25 = numerator/denominator 
B)  5/25 = 0 
C)  5/25 = 0.2 
D)  25/5 = 5 
E)  25/5 = 25/5

Question 7

Data that is to be sorted in ascending order is ordered

Accepted Answer

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 
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

Question 8

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.

Accepted Answer

A)  20,000 
B)  only the first two 
C)  only half 
D)  2,000 
E)  None of these 
A)  20,000 
B)  only the first two 
C)  only half 
D)  2,000 
E)  None of these

Question 9

If you are using the bubble sort algorithm to sort an array in descending order, the smaller values move toward the end.

Accepted Answer

A) True 
 B)False

Question 10

The linear search repeatedly divides the portion of an array being searched in half.

Accepted Answer

A) True 
 B)False

A binary search begins with the __________ element of an array.

Regardless of the algorithm being used, a search through an array is always performed

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

You are more likely to find an item by using a binary search than by using a linear search.

A selection sort and a binary search can be applied to STL vectors as well as arrays.

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;

Data that is to be sorted in ascending order is ordered

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.

If you are using the bubble sort algorithm to sort an array in descending order, the smaller values move toward the end.

The linear search repeatedly divides the portion of an array being searched in half.

Introduction to Computers and Programming

Introduction to C

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays and Vectors

Pointers

Characters, C-Strings, and More About the String Class

Structured Data

Advanced File Operations

Introduction to Classes

More About Classes

Inheritance, Polymorphism, and Virtual Functions

Exceptions and Templates

The Standard Template Library

Linked Lists

Stacks and Queues

Recursion

Binary Trees

Filters

Exam 8: Searching and Sorting Arrays

A binary search begins with the __________ element of an array.

Regardless of the algorithm being used, a search through an array is always performed

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

You are more likely to find an item by using a binary search than by using a linear search.

A selection sort and a binary search can be applied to STL vectors as well as arrays.

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;

Data that is to be sorted in ascending order is ordered

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.

If you are using the bubble sort algorithm to sort an array in descending order, the smaller values move toward the end.

The linear search repeatedly divides the portion of an array being searched in half.

Introduction to Computers and Programming

Introduction to C

Expressions and Interactivity

Making Decisions

Loops and Files

Functions

Arrays and Vectors

Pointers

Characters, C-Strings, and More About the String Class

Structured Data

Advanced File Operations

Introduction to Classes

More About Classes

Inheritance, Polymorphism, and Virtual Functions

Exceptions and Templates

The Standard Template Library

Linked Lists

Stacks and Queues

Recursion

Binary Trees

Filters