Question 1

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

Accepted Answer

Both bubble sort and selection sort can be used with STL vectors since vectors are a container in the STL library.

Question 2

A binary search begins by examining the _ element of an array.
A)smallest
B)last
C)largest
D)middle
E)first

Accepted Answer

A binary search algorithm starts by examining the middle element of a sorted array to determine if the target value is in the left or right half, allowing it to efficiently narrow down the search range.

Question 3

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

The answer of If algorithm A requires 2n + 1...

Question 4

To determine that a item is not in an unordered array of 100 items, linear search must examine an average of values.
A)7
B)10
C)50
D)100
E)101

Accepted Answer

The answer of To determine that a item is not...

Question 5

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

Accepted Answer

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

Question 6

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

Sorting an array of objects typically involves comparing the objects based on a specific property or multiple properties, but the actual sorting algorithm may not necessarily swap just the values of the data members. Instead, it swaps the objects themselves to maintain the integrity of the objects.

Question 7

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

Accepted Answer

Using a binary search, the time complexity is O(log n), whereas using a linear search, the time complexity is O(n), which means the binary search is faster and more likely to find an item.

Question 8

To determine that a value is not present in an unordered array of 50 items, linear search must examine an average of values.
A)1
B)6
C)25
D)50
E)51

Accepted Answer

The answer of To determine that a value is not...

Question 9

To find a value that is in an unordered array of 100 items, linear search must examine an average of values.
A)7
B)10
C)50
D)100
E)101

Accepted Answer

In an unordered array, linear search examines each element sequentially. On average, it will check half of the elements before finding the target, which is 50 for an array of 100 items.

Question 10

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

Accepted Answer

The search key is compared to the key field of each object to find the desired object in the array.

Question 11

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

Vectors are implemented using arrays, so any sorting algorithm that works on arrays will also work on vectors.

Question 12

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

If the number of basic operations required by two algorithms are of the same order (in this case, both have a dominant term of n), then they are considered equally efficient.

Question 13

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

Accepted Answer

The likelihood of finding an item does not depend on the search algorithm (binary or linear search) but on whether the item is present in the data set. Both methods will find the item if it exists.

Question 14

To locate a value in an ordered array of 100 items, binary search must examine at most values.
A)7
B)10
C)50
D)100
E)101

Accepted Answer

Binary search repeatedly divides the search space in half until the value is found or the search space is exhausted. In the worst case, the value is not found and the search space is exhausted, which means that binary search must examine 100/2 = 50 values.

Question 15

A binary search requires that the elements be in order.

Accepted Answer

Binary search is a search algorithm that requires the elements to be sorted in order to work efficiently. If the elements are not sorted, binary search cannot guarantee the correct search results.

Question 16

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

Accepted Answer

Binary search requires the data to be sorted, so it cannot be used for unordered sets of data. Linear search would be the only option for an unordered set.

Quiz 9: Searching, Sorting, and Algorithm Analysis

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

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, algorithm A is considered to be more efficient than Algorithm B.

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

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

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.

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

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

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

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

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

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

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

A binary search requires that the elements be in order.

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