Question 1

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

Accepted Answer

A) True 
 B)False

Question 2

The advantage of a linear search is that

Accepted Answer

A)  it is simple.
B)  it is efficient.
C)  it is fast.
D)  it can be used on unordered data.
E)  both A and DF) B) and C)
G) C) and E)

Question 3

We can estimate the of an algorithm by counting the number of steps it requires to solve a problem.

Accepted Answer

A)  code quality
B)  number of lines of code
C)  run time
D)  efficiency
E)  resultF) A) and E)
G) B) and D)

Question 4

A search can be performed on an array of

Accepted Answer

A)  strings.
B)  integers.
C)  objects.
D)  all of the above.
E)  A and B, but not C.F) C) and E)
G) B) and D)

Question 5

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

Accepted Answer

A)  1
B)  6
C)  25
D)  50
E)  51F) B) and C)
G) None of the above

Question 6

Bubble sort and selection sort can also be used with STL vectors.

Accepted Answer

A) True 
 B)False

Question 7

To determine that a item is not 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)  101F) A) and E)
G) A) and D)

Question 8

Using a binary search, you are more likely to find an item than if you use a linear search.

Accepted Answer

A) True 
 B)False

Question 9

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

Accepted Answer

A)  7
B)  10
C)  50
D)  100
E)  101F) C) and D)
G) A) and E)

Question 10

Using a linear search, you are more likely to find an item than if you use a binary search.

Accepted Answer

A) True 
 B)False

Question 11

A(n) ________search is more efficient than a(n) ________search.

Accepted Answer

A)  integer, double
B)  string, double
C)  binary, linear
D)  linear, binary
E)  None of the above. All searches are equally efficient.F) A) and B)
G) All of the above

Question 12

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

Accepted Answer

A)  random
B)  selection
C)  binary
D)  linear
E)  bubbleF) C) and E)
G) D) and E)

Question 13

The________ sort usually performs fewer exchanges than the________ sort.

Accepted Answer

A)  selection, bubble
B)  bubble, selection
C)  linear, bubble
D)  linear, binary
E)  binary, linearF) C) and E)
G) C) and D)

Question 14

A binary search requires that the elements be in order.

Accepted Answer

A) True 
 B)False

Question 15

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

Accepted Answer

A)  smallest
B)  last
C)  largest
D)  middle
E)  firstF) A) and E)
G) All of the above

Question 16

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

Exam 9: Searching, Sorting, and Algorithm Analysis

A binary search requires that the elements be in order.

Correct Answer
verified

Using a binary search, you are more likely to find an item than if you use a linear search.

Correct Answer
verified

The sort usually performs fewer exchanges than the sort.

Correct Answer
verified

A search can be performed on an array of

Correct Answer
verified

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

Correct Answer
verified

A(n) search is more efficient than a(n) search.

Correct Answer
verified

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

Correct Answer
verified

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

Correct Answer
verified

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

Correct Answer
verified

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.

Correct Answer
verified

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

Correct Answer
verified

Bubble sort and selection sort can also be used with STL vectors.

Correct Answer
verified

Using a linear search, you are more likely to find an item than if you use a binary search.

Correct Answer
verified

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

Correct Answer
verified

The advantage of a linear search is that

Correct Answer
verified

We can estimate the of an algorithm by counting the number of steps it requires to solve a problem.

Correct Answer
verified

Exam 9: Searching, Sorting, and Algorithm Analysis

A binary search requires that the elements be in order.

Correct AnswerverifiedShow Answer

Using a binary search, you are more likely to find an item than if you use a linear search.

Correct AnswerverifiedShow Answer

The________ sort usually performs fewer exchanges than the________ sort.

Correct AnswerverifiedShow Answer

A search can be performed on an array of

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

A(n) ________search is more efficient than a(n) ________search.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Bubble sort and selection sort can also be used with STL vectors.

Correct AnswerverifiedShow Answer

Using a linear search, you are more likely to find an item than if you use a binary search.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

The advantage of a linear search is that

Correct AnswerverifiedShow Answer

We can estimate the of an algorithm by counting the number of steps it requires to solve a problem.

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

The sort usually performs fewer exchanges than the sort.

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

A(n) search is more efficient than a(n) search.

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified