Question 1

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

Accepted Answer

n(n-1)/2

Question 2

When working with the unsorted portion of a list, the second step in a selection sort is to ____.

Accepted Answer

A)  divide the list into two parts 
B)  move the smallest element to the top of the list (position 0) 
C)  move the smallest element to the beginning of the unsorted list 
D)  find the smallest element 
A)  divide the list into two parts 
B)  move the smallest element to the top of the list (position 0) 
C)  move the smallest element to the beginning of the unsorted list 
D)  find the smallest element C

Question 3

Assume 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 C

Question 4

A sequence of branches in a comparison tree is called a(n) ____________________.

Accepted Answer

The answer of A sequence of branches in a comparison...

Question 5

The sequential search algorithm does not require that the list be sorted.

Accepted Answer

A) True 
 B)False

Question 6

If n = 1000, to sort the list, bubble sort makes about ____ item assignments.

Accepted Answer

A)  10,000 
B)  100,000 
C)  250,000 
D)  500,000 
A)  10,000 
B)  100,000 
C)  250,000 
D)  500,000

Question 7

A comparison tree is a(n) ____________________ tree.

Accepted Answer

The answer of A comparison tree is a(n) ____________________ tree....

Question 8

To construct a search algorithm of the order less than log2n, it cannot be ____________________ based.

Accepted Answer

Question 9

In the average case, 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 10

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

Accepted Answer

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

Question 11

For a list of length n, insertion sort makes ____ key comparisons, in the worst case.

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 12

When moving array values for insertion sort, to move list[4] into list[2], first ____.

Accepted Answer

A)  move list[2] to list[3] 
B)  delete list[2] 
C)  move list[4] to list[3] 
D)  copy list[4] into temp 
A)  move list[2] to list[3] 
B)  delete list[2] 
C)  move list[4] to list[3] 
D)  copy list[4] into temp

Question 13

Let f be a function of n.By the term ____________________, we mean the study of the function f as n becomes larger and larger without bound.

Accepted Answer

The answer of Let f be a function of n.By...

Question 14

We can trace the execution of a comparison-based algorithm by using a graph called a ____.

Accepted Answer

A)  pivot table 
B)  partition table 
C)  comparison tree 
D)  merge tree 
A)  pivot table 
B)  partition table 
C)  comparison tree 
D)  merge tree

Question 15

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 16

The swap function of quick sort is written differently from the swap function for selection sort.

Accepted Answer

A) True 
 B)False

Question 17

The binary search algorithm can be written iteratively or recursively.

Accepted Answer

A) True 
 B)False

Question 18

The behavior of merge sort is ____ in the worst case and ____ in the average case.

Accepted Answer

A)  O(nlog2n), O(nlog2n) 
B)  O(n2), O(n) 
C)  O(nlog2n), O(n2) 
D)  O(n2), O(nlog2n) 
A)  O(nlog2n), O(nlog2n) 
B)  O(n2), O(n) 
C)  O(nlog2n), O(n2) 
D)  O(n2), O(nlog2n)

Question 19

In a bubble sort for list of length n, the first step is to compare elements ____.

Accepted Answer

A)  list[0] and list[n] 
B)  list[0] and list[n-1] 
C)  list[0] and list[1] 
D)  list[n-1] and list[n+1] 
A)  list[0] and list[n] 
B)  list[0] and list[n-1] 
C)  list[0] and list[1] 
D)  list[n-1] and list[n+1]

Question 20

In a bubble sort, the smaller elements move toward the bottom, and the larger elements move toward the top of the list.

Accepted Answer

A) True 
 B)False

Exam 18: Searching and Sorting Algorithms

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

When working with the unsorted portion of a list, the second step in a selection sort is to ____.

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

A sequence of branches in a comparison tree is called a(n) ____________________.

The sequential search algorithm does not require that the list be sorted.

If n = 1000, to sort the list, bubble sort makes about ____ item assignments.

A comparison tree is a(n) ____________________ tree.

To construct a search algorithm of the order less than log2n, it cannot be ____________________ based.

In the average case, sequential search typically searches ____.

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

For a list of length n, insertion sort makes ____ key comparisons, in the worst case.

When moving array values for insertion sort, to move list[4] into list[2], first ____.

Let f be a function of n.By the term ____________________, we mean the study of the function f as n becomes larger and larger without bound.

We can trace the execution of a comparison-based algorithm by using a graph called a ____.

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

The swap function of quick sort is written differently from the swap function for selection sort.

The binary search algorithm can be written iteratively or recursively.

The behavior of merge sort is ____ in the worst case and ____ in the average case.

In a bubble sort for list of length n, the first step is to compare elements ____.

In a bubble sort, the smaller elements move toward the bottom, and the larger elements move toward the top of the list.

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

Operator Overloading and Templates

Exception Handling

Recursion

Linked Lists

Stacks and Queue

Binary Trees

Graph Algorithms

Standard Template Library

Filters

To construct a search algorithm of the order less than log₂n, it cannot be ____________________ based.

The behavior of merge sort is in the worst case and in the average case.