Question 1

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 2

Assuming the following list declaration, which element is at the position 0 after the first iteration of selection sort? int list[] = {16, 30, 24, 7, 62, 45, 5, 55}

Accepted Answer

A)  5 
B)  7 
C)  16 
D)  62 
A)  5 
B)  7 
C)  16 
D)  62

Question 3

In a binary search, first, the search item is compared with the last element of the list.

Accepted Answer

A) True 
 B)False

Question 4

The first step in the quick sort partition algorithm is to determine the ____________________ and swap it with the first element in the list.

Accepted Answer

The answer of The first step in the quick sort...

Question 5

In the bubble sort algorithm, the following 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 6

In a quick sort, all of the sorting work is done by the function ____________________.

Accepted Answer

The answer of In a quick sort, all of the...

Question 7

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

Accepted Answer

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

Question 8

A sequential search of an n-element list takes ____ key comparisons if the item is not in the list.

Accepted Answer

A)  0 
B)  n/2 
C)  n 
D)  n2 
A)  0 
B)  n/2 
C)  n 
D)  n2

Question 9

____ sort requires knowing where the middle element of the list is.

Accepted Answer

A)  Merge 
B)  Bubble 
C)  Insertion 
D)  Selection 
A)  Merge 
B)  Bubble 
C)  Insertion 
D)  Selection

Question 10

With the binary search algorithm, ____ key comparison(s) is/are made in the successful case-the last time through the loop.

Accepted Answer

A)  one 
B)  two 
C)  n-2 
D)  n 
A)  one 
B)  two 
C)  n-2 
D)  n

Question 11

The ____________________ search algorithm is the optimal worst-case algorithm for solving search problems by using the comparison method.

Accepted Answer

The answer of The ____________________ search algorithm is the optimal...

Question 12

The selection sort algorithm finds the location of the smallest element in the unsorted portion of the list.

Accepted Answer

A) True 
 B)False

Question 13

A sequential search of an n-element list takes ____ key comparisons on average to determine whether the search item is in the list.

Accepted Answer

A)  0 
B)  n/2 
C)  n 
D)  n2 
A)  0 
B)  n/2 
C)  n 
D)  n2

Question 14

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 15

The top node of a comparison tree is call the ____________________ node.

Accepted Answer

The answer of The top node of a comparison tree...

Question 16

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 17

If n = 1000, then to sort the list, selection sort makes about 50,000 key comparisons.

Accepted Answer

A) True 
 B)False

Question 18

Suppose that L is a sorted list of size 1024, and we want to determine whether an item x is in L.From the binary search algorithm, it follows that every iteration of the while loop cuts the size of the search list by half.

Accepted Answer

A) True 
 B)False

Question 19

The behavior of quick 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 20

With insertion sort, the variable firstOutOfOrder is initialized to ____, assuming n is the length of the list.

Accepted Answer

A)  0 
B)  1 
C)  n - 1 
D)  n 
A)  0 
B)  1 
C)  n - 1 
D)  n

Exam 18: Searching and Sorting Algorithms

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

Assuming the following list declaration, which element is at the position 0 after the first iteration of selection sort? int list[] = {16, 30, 24, 7, 62, 45, 5, 55}

In a binary search, first, the search item is compared with the last element of the list.

The first step in the quick sort partition algorithm is to determine the ____________________ and swap it with the first element in the list.

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

In a quick sort, all of the sorting work is done by the function ____________________.

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

A sequential search of an n-element list takes ____ key comparisons if the item is not in the list.

____ sort requires knowing where the middle element of the list is.

With the binary search algorithm, ____ key comparison(s) is/are made in the successful case-the last time through the loop.

The ____________________ search algorithm is the optimal worst-case algorithm for solving search problems by using the comparison method.

The selection sort algorithm finds the location of the smallest element in the unsorted portion of the list.

A sequential search of an n-element list takes ____ key comparisons on average to determine whether the search item is in the list.

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 top node of a comparison tree is call the ____________________ node.

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

If n = 1000, then to sort the list, selection sort makes about 50,000 key comparisons.

Suppose that L is a sorted list of size 1024, and we want to determine whether an item x is in L.From the binary search algorithm, it follows that every iteration of the while loop cuts the size of the search list by half.

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

With insertion sort, the variable firstOutOfOrder is initialized to ____, assuming n is the length 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

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