Question 1

Sequential search typically searches ____.

Accepted Answer

A)  one quarter of the list 
B)  one third of the list 
C)  one half of the list 
D)  the entire list 
A)  one quarter of the list 
B)  one third of the list 
C)  one half of the list 
D)  the entire list C

Question 2

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

Accepted Answer

A) vector intList[5]; B) vector intList(5); C) vector intList(); D) vector(int) intList[5]; A) vector intList[5]; B) vector intList(5); C) vector intList(); D) vector(int) intList[5]; B

Question 3

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

Accepted Answer

A) vecList[index] B) vecList.get(index) C) vecList.front(index) D) vecList A) vecList[index] B) vecList.get(index) C) vecList.front(index) D) vecList A

Question 4

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

Accepted Answer

A)  n(n-1)/4 
B)  n(n-1)/2 
C)  n2 
D)  n3 
A)  n(n-1)/4 
B)  n(n-1)/2 
C)  n2 
D)  n3

Question 5

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};

Accepted Answer

A)  89 73 56 46 34 25 16 10 5 2 
B)  2 56 34 25 5 16 89 46 73 
C)  2 5 10 16 25 34 46 56 73 89 
D)  2 10 16 25 34 46 56 73 89 
A)  89 73 56 46 34 25 16 10 5 2 
B)  2 56 34 25 5 16 89 46 73 
C)  2 5 10 16 25 34 46 56 73 89 
D)  2 10 16 25 34 46 56 73 89

Question 6

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

Accepted Answer

A)  list[0]...list[6] 
B)  list[0]...list[7] 
C)  list[5]...list[11] 
D)  list[6]...list[11] 
A)  list[0]...list[6] 
B)  list[0]...list[7] 
C)  list[5]...list[11] 
D)  list[6]...list[11]

Question 7

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

Accepted Answer

The answer of In order to apply a(n) ____________________ search,...

Question 8

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

Accepted Answer

A) True 
 B)False

Question 9

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;
}

Accepted Answer

The answer of The code below represents the ____________________ search...

Question 10

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

Accepted Answer

The answer of The first element in a vector object...

Question 11

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

Accepted Answer

A) True 
 B)False

Question 12

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

Accepted Answer

A)  int 
B)  bool 
C)  char 
D)  double 
A)  int 
B)  bool 
C)  char 
D)  double

Question 13

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.

Accepted Answer

A) True 
 B)False

Question 14

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

Accepted Answer

A) True 
 B)False

Question 15

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

Accepted Answer

push_back(

Question 16

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

Accepted Answer

A) vector[elemType] vecList(size); B) vector vecList(size); C) vector(size) vecList D) vector{ele A) vector[elemType] vecList(size); B) vector vecList(size); C) vector(size) vecList D) vector{ele

Question 17

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

Accepted Answer

The answer of A(n) ____________________ search uses the "divide and...

Question 18

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

Accepted Answer

The answer of For a list size of 1000, on...

Question 19

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

Accepted Answer

A)  Searching the list 
B)  Reversing the order of the elements 
C)  Finding the maximum element 
D)  Displaying the elements 
A)  Searching the list 
B)  Reversing the order of the elements 
C)  Finding the maximum element 
D)  Displaying the elements

Question 20

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

Accepted Answer

A)  element 
B)  two elements 
C)  three elements 
D)  n-2 
A)  element 
B)  two elements 
C)  three elements 
D)  n-2

Sequential search typically searches ____.

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

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

For a list of length n, insertion sort makes ____ 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};

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

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

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

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

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

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

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.

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

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

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

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

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

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

An Overview of Computers and Programming Languages

Basic Elements of C

Inputoutput

Control Structures I Selection

Control Structures II Repetition

User-Defined Functions

User-Defined Simple Data Types, Namespaces, and the String Type

Arrays and Strings

Records Structs

Classes and Data Abstraction

Inheritance and Composition

Pointers, Classes, Virtual Functions, and Abstract Classes

Overloading and Templates

Exception Handling

Recursion

Linked Lists

Stacks and Queues

Filters

Exam 16: Searching, Sorting and the Vector Type

Sequential search typically searches ____.

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

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

For a list of length n, insertion sort makes ____ 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};

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

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

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

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

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

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

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.

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

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

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

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

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

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

An Overview of Computers and Programming Languages

Basic Elements of C

Inputoutput

Control Structures I Selection

Control Structures II Repetition

User-Defined Functions

User-Defined Simple Data Types, Namespaces, and the String Type

Arrays and Strings

Records Structs

Classes and Data Abstraction

Inheritance and Composition

Pointers, Classes, Virtual Functions, and Abstract Classes

Overloading and Templates

Exception Handling

Recursion

Linked Lists

Stacks and Queues

Filters