Question 1

For a list of length n, the bubble sort makes exactly ____ key comparisons.

Accepted Answer

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

Question 2

The code shown represents the ____________________ search algorithm.

Accepted Answer

sequential

Question 3

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  True

Question 4

Consider the following list: int list[] = {4, 8, 19, 25, 34, 39, 45, 48, 66, 75, 89, 95}
When performing a binary search, the element to be found is first compared with ____.

Accepted Answer

A)  4 
B)  25 
C)  39 
D)  95 
A)  4 
B)  25 
C)  39 
D)  95

Question 5

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 6

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

Accepted Answer

A) True 
 B)False

Question 7

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

Question 8

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 9

A sequential search is much faster than a binary search.

Accepted Answer

A) True 
 B)False

Question 10

If the search item is the 900th item in the list, the sequential search makes ____ key comparisons to determine whether the search item is in the list.

Accepted Answer

A)  100 
B)  900 
C)  9000 
D)  90,000 
A)  100 
B)  900 
C)  9000 
D)  90,000

Question 11

All of the values in a list have the same type.

Accepted Answer

A) True 
 B)False

Question 12

The formula to find the index of the middle element of a list is ____.

Accepted Answer

A)  (mid + last)/2 
B)  (first + last) - 2 
C)  (first + last) / 2 
D)  (first + mid ) * 2 
A)  (mid + last)/2 
B)  (first + last) - 2 
C)  (first + last) / 2 
D)  (first + mid ) * 2

Question 13

The type vector provides the function ____________________, which returns the first element in the vector object.

Accepted Answer

The answer of The type vector provides the function ____________________,...

Question 14

The insertion sort algorithm sorts the list by moving each element to its proper place.

Accepted Answer

A) True 
 B)False

Question 15

In the bubble sort algorithm, which code accomplishes swapping values in elements at positions index and index + 1?

Accepted Answer

A)  list[index] = list[index + 1]
List[index + 1] = list[index] 
B)  list[index + 1] = list[index]
List[index] = list[index + 1] 
C)  list[index] = temp;
List[index] = list[index + 1];
Temp = list[index + 1]; 
D)  temp = list[index];
List[index] = list[index + 1];
List[index + 1] = temp; 
A)  list[index] = list[index + 1]
List[index + 1] = list[index] 
B)  list[index + 1] = list[index]
List[index] = list[index + 1] 
C)  list[index] = temp;
List[index] = list[index + 1];
Temp = list[index + 1]; 
D)  temp = list[index];
List[index] = list[index + 1];
List[index + 1] = temp;

Question 16

Which statement declares intList to be an empty vector?

Accepted Answer

A) vector intList(); B) vector intList(0); C) vector intList(10); D) vector intList; A) vector intList(); B) vector intList(0); C) vector intList(10); D) vector intList;

Question 17

If you want to use the class vector in your program, you must include the following statement: ____________________.

Accepted Answer

#include &

Question 18

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 19

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 20

In a sequential search, if a search item is not in a list of 1000 elements, then ____ key comparisons will be made.

Accepted Answer

A)  100 
B)  1000 
C)  10,000 
D)  100,000 
A)  100 
B)  1000 
C)  10,000 
D)  100,000

For a list of length n, the bubble sort makes exactly ____ key comparisons.

The code shown represents the ____________________ search algorithm.

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.

Consider the following list: int list[] = {4, 8, 19, 25, 34, 39, 45, 48, 66, 75, 89, 95} When performing a binary search, the element to be found is first compared with ____.

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

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

Sequential search typically searches ____.

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

A sequential search is much faster than a binary search.

If the search item is the 900th item in the list, the sequential search makes ____ key comparisons to determine whether the search item is in the list.

All of the values in a list have the same type.

The formula to find the index of the middle element of a list is ____.

The type vector provides the function ____________________, which returns the first element in the vector object.

The insertion sort algorithm sorts the list by moving each element to its proper place.

In the bubble sort algorithm, which code accomplishes swapping values in elements at positions index and index + 1?

Which statement declares intList to be an empty vector?

If you want to use the class vector in your program, you must include the following statement: ____________________.

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

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

In a sequential search, if a search item is not in a list of 1000 elements, then ____ key comparisons will be made.

An Overview of Computers and Programming Languages

Basic Elements of C++

Inputoutput

Control Structures I Selection

Control Structures II Repetition

User-Defined Function

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

Arrays

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 and Sorting

For a list of length n, the bubble sort makes exactly ____ key comparisons.

The code shown represents the ____________________ search algorithm.

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.

Consider the following list: int list[] = {4, 8, 19, 25, 34, 39, 45, 48, 66, 75, 89, 95} When performing a binary search, the element to be found is first compared with ____.

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

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

Sequential search typically searches ____.

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

A sequential search is much faster than a binary search.

If the search item is the 900th item in the list, the sequential search makes ____ key comparisons to determine whether the search item is in the list.

All of the values in a list have the same type.

The formula to find the index of the middle element of a list is ____.

The type vector provides the function ____________________, which returns the first element in the vector object.

The insertion sort algorithm sorts the list by moving each element to its proper place.

In the bubble sort algorithm, which code accomplishes swapping values in elements at positions index and index + 1?

Which statement declares intList to be an empty vector?

If you want to use the class vector in your program, you must include the following statement: ____________________.

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

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

In a sequential search, if a search item is not in a list of 1000 elements, then ____ key comparisons will be made.

An Overview of Computers and Programming Languages

Basic Elements of C++

Inputoutput

Control Structures I Selection

Control Structures II Repetition

User-Defined Function

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

Arrays

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