The number in parentheses at the end of an exercise refers to the learning objective listed at the beginning of the chapter.
Mark the following statements as true or false.
a. A list is a collection of elements of the same type. (1)
b. A sequential search of a list assumes that the list elements are sorted in ascending order. (1)
c. For a list of length 100, the bubble sort given in this chapter makes exactly 5050 key comparisons to sort the list. (2)
d. A binary search of a list assumes that the list is sorted. (3)
e. A binary search is faster on ordered lists and slower on unordered lists. (3)
f. A binary search is faster on large lists, but a sequential search is faster on small lists. (3)
g. When you declare a vector object and specify its size as 10, then only 10 elements can be stored in the object. (4)
h. Suppose vecList is a vector object. The expression vecList.capacity() returns the number of elements that can be currently added to vecList. (4)
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.