FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 16: Searching, Sorting and the Vector Type

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 1

Short Answer

Review LaterAdd Note

Review Later

The first element in a vector object is at location ____________________.

Correct Answer

verified

Show Answer

Question 2

Short Answer

Review LaterAdd Note

Review Later

A(n) ____________________ search uses the "divide and conquer" technique to search the list.

Correct Answer

verified

Show Answer

Question 3

Multiple Choice

Review LaterAdd Note

The sequential search algorithm uses a(n) ____ variable to track whether the item is found.

In order to apply a(n) ____________________ search, the list must be sorted.

Sequential search typically searches ____.

____ is one of the basic operations that may be performed on a list.

After the second iteration of bubble sort for a list of length n, the last ____ are sorted.

The type vector provides the expression ____________________, which inserts a copy of elem into vecList at the end.

Consider the following list. int list[] = {4, 8, 19, 25, 34, 39, 45, 48, 66, 75, 89, 95} When performing a binary search for 75, after the first comparison, the search is restricted to ____.

The code below represents the ____________________ search algorithm. int unknownSearch(const int list[], int listLength, int searchItem) { $\quad$ int loc; $\quad$ bool found = false; $\quad$ loc = 0; $\quad$ while (loc < listLength && !found) $\quad$$\quad$ if (list[loc] == searchItem) $\quad$$\quad$$\quad$ found = true; $\quad$$\quad$ else $\quad$$\quad$$\quad$ loc++; $\quad$ if (found) $\quad$$\quad$ return loc; $\quad$ else $\quad$$\quad$ return -1; }

During the sorting phase of insertion sort, the array containing the list is divided into two sublists, sorted and unsorted.

The statement ____ returns the element at the position index in vector vecList.

For a list size of 1000, on average, the sequential search makes about ____________________ key comparisons.

The statement ____ creates the vector object vecList of size size.

Assume that n = 1000. To sort the list, insertion sort makes about 250,000 item assignments.

Assuming that list consists of the following elements, what is the result after bubble sort completes? int list[] = {2, 56, 34, 25, 73, 46, 89, 10, 5, 16};

The sequential search algorithm does not assume that the list is sorted.

Which of the following statements declares intList to be a vector of size 5 and the element to be of type int?

The performance of bubble sort can be improved if we stop the sorting process as soon as we find that, in an iteration, no swapping of elements takes place.

For a list of length n, insertion sort makes ____ item assignments.