Question 1

A binary search begins by examining the ________ element of an array.

Accepted Answer

A)  first 
B)  last 
C)  largest 
D)  middle 
E)  smallest 
A)  first 
B)  last 
C)  largest 
D)  middle 
E)  smallest

Question 2

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, algorithms A and B are considered to be equally efficient.

Accepted Answer

A) True 
 B)False

Question 3

The ________ sort usually performs more exchanges than the ________ sort.

Accepted Answer

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

Question 4

If a selection sort is used to arrange the numbers 7 5 3 9 2 6 in ascending order, what order will the data be in after the first pass?

Accepted Answer

A)  2 5 3 9 7 6 
B)  5 7 3 9 2 6 
C)  5 3 7 2 6 9 
D)  2 3 5 6 7 9 
E)  none of the above 
A)  2 5 3 9 7 6 
B)  5 7 3 9 2 6 
C)  5 3 7 2 6 9 
D)  2 3 5 6 7 9 
E)  none of the above

Question 5

To find a value in an ordered array of 100 items, how many values must binary search examine at most?

Accepted Answer

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

Question 6

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

Accepted Answer

A) True 
 B)False

Question 7

To determine that an item is not in an unordered array of 100 items, how many values must linear search examine on average?

Accepted Answer

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

Question 8

When sorting an array of objects or structures, one must decide which data item to sort on.

Accepted Answer

A) True 
 B)False

Question 9

A binary search requires that the elements be in order.

Accepted Answer

A) True 
 B)False

Question 10

If a selection sort is used to arrange the numbers 8 6 4 9 3 7 in ascending order, what order will the data be in after the first pass of the sort is completed?

Accepted Answer

A)  3 4 6 7 8 9 
B)  3 6 4 9 8 7 
C)  6 4 8 3 7 9 
D)  6 8 4 9 3 7 
E)  None of the above 
A)  3 4 6 7 8 9 
B)  3 6 4 9 8 7 
C)  6 4 8 3 7 9 
D)  6 8 4 9 3 7 
E)  None of the above

Question 11

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

Accepted Answer

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

Question 12

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)  array index first > array index last. 
B)  Boolean variable found equals false. 
C)  Boolean variable found equals True. 
D)  it finds a value larger than the search key. 
E)  it has examined all the elements in the array. 
A)  array index first > array index last. 
B)  Boolean variable found equals false. 
C)  Boolean variable found equals True. 
D)  it finds a value larger than the search key. 
E)  it has examined all the elements in the array.

Question 13

To find a value that is in an unordered array of 50 items, how many values must linear search examine on average?

Accepted Answer

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

Question 14

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

Accepted Answer

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

Question 15

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 16

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

Accepted Answer

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

Question 17

If a bubble sort is used to arrange the numbers 8 6 4 9 3 7 in ascending order, what order will the data be in after the first pass of the sort is completed?

Accepted Answer

A)  3 4 6 7 8 9 
B)  3 6 4 9 8 7 
C)  6 4 8 3 7 9 
D)  6 8 4 9 3 7 
E)  None of the above 
A)  3 4 6 7 8 9 
B)  3 6 4 9 8 7 
C)  6 4 8 3 7 9 
D)  6 8 4 9 3 7 
E)  None of the above

Question 18

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

Accepted Answer

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

Question 19

If a binary search is used to search for the number 4 in the 11-element array shown here int A[] = {1, 2, 3, 4, 6, 7, 8, 9, 10, 12, 17};
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 20

If a bubble sort is used to arrange the numbers 7 5 3 9 2 6 in ascending order, what order will the data be in after the first pass?

Accepted Answer

A)  2 5 3 9 7 6 
B)  5 7 3 9 2 6 
C)  5 3 7 2 6 9 
D)  2 3 5 6 7 9 
E)  none of the above 
A)  2 5 3 9 7 6 
B)  5 7 3 9 2 6 
C)  5 3 7 2 6 9 
D)  2 3 5 6 7 9 
E)  none of the above

A binary search begins by examining the ________ element of an array.

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, algorithms A and B are considered to be equally efficient.

The sort usually performs more exchanges than the sort.

If a selection sort is used to arrange the numbers 7 5 3 9 2 6 in ascending order, what order will the data be in after the first pass?

To find a value in an ordered array of 100 items, how many values must binary search examine at most?

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

To determine that an item is not in an unordered array of 100 items, how many values must linear search examine on average?

When sorting an array of objects or structures, one must decide which data item to sort on.

A binary search requires that the elements be in order.

If a selection sort is used to arrange the numbers 8 6 4 9 3 7 in ascending order, what order will the data be in after the first pass of the sort is completed?

Selection sort requires ________ passes to put n data items 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 find a value that is in an unordered array of 50 items, how many values must linear search examine on average?

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

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.

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

If a bubble sort is used to arrange the numbers 8 6 4 9 3 7 in ascending order, what order will the data be in after the first pass of the sort is completed?

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

If a binary search is used to search for the number 4 in the 11-element array shown here int A[] = {1, 2, 3, 4, 6, 7, 8, 9, 10, 12, 17}; Which value will the 4 be compared to first?

If a bubble sort is used to arrange the numbers 7 5 3 9 2 6 in ascending order, what order will the data be in after the first pass?

Introduction to Computers and Programming

Introduction to C Plus Plus

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, Algorithm Analysis

A binary search begins by examining the ________ element of an array.

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, algorithms A and B are considered to be equally efficient.

The ________ sort usually performs more exchanges than the ________ sort.

If a selection sort is used to arrange the numbers 7 5 3 9 2 6 in ascending order, what order will the data be in after the first pass?

To find a value in an ordered array of 100 items, how many values must binary search examine at most?

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

To determine that an item is not in an unordered array of 100 items, how many values must linear search examine on average?

When sorting an array of objects or structures, one must decide which data item to sort on.

A binary search requires that the elements be in order.

If a selection sort is used to arrange the numbers 8 6 4 9 3 7 in ascending order, what order will the data be in after the first pass of the sort is completed?

Selection sort requires ________ passes to put n data items 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 find a value that is in an unordered array of 50 items, how many values must linear search examine on average?

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

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.

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

If a bubble sort is used to arrange the numbers 8 6 4 9 3 7 in ascending order, what order will the data be in after the first pass of the sort is completed?

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

If a binary search is used to search for the number 4 in the 11-element array shown here int A[] = {1, 2, 3, 4, 6, 7, 8, 9, 10, 12, 17}; Which value will the 4 be compared to first?

If a bubble sort is used to arrange the numbers 7 5 3 9 2 6 in ascending order, what order will the data be in after the first pass?

Introduction to Computers and Programming

Introduction to C Plus Plus

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

The sort usually performs more exchanges than the sort.