Question 1

The sort usually performs more exchanges than the sort.

Accepted Answer

A) binary, linear 
B) linear, bubble 
C) bubble, selection 
D) linear, binary 
E) selection, bubble 
A) binary, linear 
B) linear, bubble 
C) bubble, selection 
D) linear, binary 
E) selection, bubble C

Question 2

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

Accepted Answer

A) ascending 
B) forward 
C) downward 
D) reverse 
E) descending 
A) ascending 
B) forward 
C) downward 
D) reverse 
E) descending E

Question 3

If the item being searched for is not in the array, binary search stops looking for it and reports that it is not there when

Accepted Answer

A) it has examined all the elements in the array. 
B) array index first > array index last. 
C) it finds a value larger than the search key. 
D) Boolean variable found equals true. 
E) Boolean variable found equals false. 
A) it has examined all the elements in the array. 
B) array index first > array index last. 
C) it finds a value larger than the search key. 
D) Boolean variable found equals true. 
E) Boolean variable found equals false. B

Question 4

To locate a value in an ordered array of 50 items, binary search must examine at most values.

Accepted Answer

A) 1 
B) 6 
C) 10 
D) 25 
E) 50 
A) 1 
B) 6 
C) 10 
D) 25 
E) 50

Question 5

A sorting algorithm can be used to arrange a set of in order.

Accepted Answer

A) numeric values, ascending 
B) strings, ascending 
C) strings, descending 
D) numeric values, descending 
E) All of the above. 
A) numeric values, ascending 
B) strings, ascending 
C) strings, descending 
D) numeric values, descending 
E) All of the above.

Question 6

If algorithm A requires 2n + 1 basic operations to process an input of size n, and Algorithm B requires 3n + 2 basic operations to process the same input, algorithm A is considered to be more efficient than Algorithm B.

Accepted Answer

A) True 
 B)False

Question 7

When sorting an array of objects, if the values in the data member being sorted on are out of order for two objects, it is necessary to

Accepted Answer

A) swap the entire two objects. 
B) examine a different data member. 
C) swap one- by- one all data members in the two objects. 
D) swap these two data values. 
E) stop the sort. 
A) swap the entire two objects. 
B) examine a different data member. 
C) swap one- by- one all data members in the two objects. 
D) swap these two data values. 
E) stop the sort.

Question 8

Any sorting algorithm, such as bubble sort or selection sort, that can be used on data stored in an array can also be used on data stored in a vector.

Accepted Answer

A) True 
 B)False

Question 9

If a binary search is used to search for the number 4 in the 11- element array shown below, which value will the 4 be compared to first?

Accepted Answer

A) 1 
B) 7 
C) 8 
D) 9 
E) 17 
A) 1 
B) 7 
C) 8 
D) 9 
E) 17

Question 10

A ________search uses a loop to sequentially step through an array.

Accepted Answer

A) linear 
B) binary 
C) bubble 
D) relative 
E) unary 
A) linear 
B) binary 
C) bubble 
D) relative 
E) unary

Question 11

To determine that a value is not present in an unordered array of 50 items, linear search must examine an average of values.

Accepted Answer

A) 1 
B) 6 
C) 25 
D) 50 
E) 51 
A) 1 
B) 6 
C) 25 
D) 50 
E) 51

Question 12

When searching for an item in an unordered set of data, binary search can find the item more quickly than linear search.

Accepted Answer

A) True 
 B)False

Question 13

When searching for a particular object in an array of objects, it is necessary to compare the to the value in each examined object's

Accepted Answer

A) key field, search key. 
B) search key, public member data. 
C) key field, public member data. 
D) search key, private member data. 
E) search key, key field. 
A) key field, search key. 
B) search key, public member data. 
C) key field, public member data. 
D) search key, private member data. 
E) search key, key field.

Question 14

A(n)algorithm arranges data into some order.

Accepted Answer

A) sorting 
B) searching 
C) binary 
D) linear 
E) ordering 
A) sorting 
B) searching 
C) binary 
D) linear 
E) ordering

Question 15

The linear search is adequate for searching through arrays, but not through ones.

Accepted Answer

A) char, string 
B) any regular, vector 
C) int, double 
D) ascending, descending 
E) small, large 
A) char, string 
B) any regular, vector 
C) int, double 
D) ascending, descending 
E) small, large

Question 16

Selection sort requires passes to put n data items in order.

Accepted Answer

A) n/2 +1 
B) n/2 
C) n+1 
D) n 
E) n- 1 
A) n/2 +1 
B) n/2 
C) n+1 
D) n 
E) n- 1

Question 17

Sorted data can be ordered

Accepted Answer

A) using a selection sort algorithm. 
B) using a bubble sort algorithm. 
C) from highest to lowest value. 
D) from lowest to highest value. 
E) in all of the above ways. 
A) using a selection sort algorithm. 
B) using a bubble sort algorithm. 
C) from highest to lowest value. 
D) from lowest to highest value. 
E) in all of the above ways.

Question 18

When sorting an array of objects, if the values in the data member being sorted on are out of order for two objects, those two data values should be swapped.

Accepted Answer

A) True 
 B)False

Question 19

We can measure the complexity of an algorithm that solves a computational problem by determining the number of for an input of size n.

Accepted Answer

A) times it loops 
B) basic steps it requires 
C) operations it performs 
D) variables it uses 
E) output statements it has 
A) times it loops 
B) basic steps it requires 
C) operations it performs 
D) variables it uses 
E) output statements it has

Question 20

To find a value that is in an unordered array of 100 items, linear search must examine an average of values.

Accepted Answer

A) 7 
B) 10 
C) 50 
D) 100 
E) 101 
A) 7 
B) 10 
C) 50 
D) 100 
E) 101

The sort usually performs more exchanges than the sort.

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

If the item being searched for is not in the array, binary search stops looking for it and reports that it is not there when

To locate a value in an ordered array of 50 items, binary search must examine at most values.

A sorting algorithm can be used to arrange a set of in order.

If algorithm A requires 2n + 1 basic operations to process an input of size n, and Algorithm B requires 3n + 2 basic operations to process the same input, algorithm A is considered to be more efficient than Algorithm B.

When sorting an array of objects, if the values in the data member being sorted on are out of order for two objects, it is necessary to

Any sorting algorithm, such as bubble sort or selection sort, that can be used on data stored in an array can also be used on data stored in a vector.

If a binary search is used to search for the number 4 in the 11- element array shown below, which value will the 4 be compared to first?

A ________search uses a loop to sequentially step through an array.

To determine that a value is not present in an unordered array of 50 items, linear search must examine an average of values.

When searching for an item in an unordered set of data, binary search can find the item more quickly than linear search.

When searching for a particular object in an array of objects, it is necessary to compare the to the value in each examined object's

A(n)algorithm arranges data into some order.

The linear search is adequate for searching through arrays, but not through ones.

Selection sort requires passes to put n data items in order.

Sorted data can be ordered

When sorting an array of objects, if the values in the data member being sorted on are out of order for two objects, those two data values should be swapped.

We can measure the complexity of an algorithm that solves a computational problem by determining the number of for an input of size n.

To find a value that is in an unordered array of 100 items, linear search must examine an average of values.

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

Pointers

More About Classes and Object-Oriented Programming

More on C-Strings and the String Class

Advanced File and Io Operations

Recursion

Polymorphism and Virtual Functions

Exceptions, Templates, and the Standard Template Library STL

Linked Lists

Stacks and Queues

Binary Trees

Filters

Exam 9: Searching, Sorting, and Algorithm Analysis

The sort usually performs more exchanges than the sort.

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

If the item being searched for is not in the array, binary search stops looking for it and reports that it is not there when

To locate a value in an ordered array of 50 items, binary search must examine at most values.

A sorting algorithm can be used to arrange a set of in order.

If algorithm A requires 2n + 1 basic operations to process an input of size n, and Algorithm B requires 3n + 2 basic operations to process the same input, algorithm A is considered to be more efficient than Algorithm B.

When sorting an array of objects, if the values in the data member being sorted on are out of order for two objects, it is necessary to

Any sorting algorithm, such as bubble sort or selection sort, that can be used on data stored in an array can also be used on data stored in a vector.

If a binary search is used to search for the number 4 in the 11- element array shown below, which value will the 4 be compared to first?

A ________search uses a loop to sequentially step through an array.

To determine that a value is not present in an unordered array of 50 items, linear search must examine an average of values.

When searching for an item in an unordered set of data, binary search can find the item more quickly than linear search.

When searching for a particular object in an array of objects, it is necessary to compare the to the value in each examined object's

A(n)algorithm arranges data into some order.

The linear search is adequate for searching through arrays, but not through ones.

Selection sort requires passes to put n data items in order.

Sorted data can be ordered

When sorting an array of objects, if the values in the data member being sorted on are out of order for two objects, those two data values should be swapped.

We can measure the complexity of an algorithm that solves a computational problem by determining the number of for an input of size n.

To find a value that is in an unordered array of 100 items, linear search must examine an average of values.

Introduction to Computers and Programming

Introduction to C++

Expressions and Interactivity

Making Decisions

Looping

Functions

Introduction to Classes and Objects

Arrays

Pointers

More About Classes and Object-Oriented Programming

More on C-Strings and the String Class

Advanced File and Io Operations

Recursion

Polymorphism and Virtual Functions

Exceptions, Templates, and the Standard Template Library STL

Linked Lists

Stacks and Queues

Binary Trees

Filters