Question 1

The first step performed by the binary search algorithm at each iteration is to:

Accepted Answer

A)  Compare the search key with the lowest element in the current subvector. 
B)  Compare the search key with the middle element in the current subvector. 
C)  Compare the search key with the highest element in the current subvector. 
D)  Count the number of elements in the current subvector. 
A)  Compare the search key with the lowest element in the current subvector. 
B)  Compare the search key with the middle element in the current subvector. 
C)  Compare the search key with the highest element in the current subvector. 
D)  Count the number of elements in the current subvector. B

Question 2

Selection sort has a Big O of:

Accepted Answer

A)  O(2n) 
B)  O(n2) 
C)  O(½n2) 
D)  O((n2 - n)/2 ) 
A)  O(2n) 
B)  O(n2) 
C)  O(½n2) 
D)  O((n2 - n)/2 ) B

Question 3

An algorithm that requires __________ operations to complete its task on n data elements is said to have linear runtime.

Accepted Answer

A)  n3 + 9 
B)  3 n2 + 3 n + 2 
C)  2 n + 1 
D)  6 
A)  n3 + 9 
B)  3 n2 + 3 n + 2 
C)  2 n + 1 
D)  6 C

Question 4

The choice of which sorting algorithm to use does not affect:

Accepted Answer

A)  How sorted the vector will be. 
B)  The time it takes for the sorting operation to complete. 
C)  The amount of memory used by the program. 
D)  All of the above will be affected by the choice of sorting algorithm. 
A)  How sorted the vector will be. 
B)  The time it takes for the sorting operation to complete. 
C)  The amount of memory used by the program. 
D)  All of the above will be affected by the choice of sorting algorithm.

Question 5

The merge sort algorithm:

Accepted Answer

A)  Can be used only on vectors of even length. 
B)  Works by reducing vectors down to the base case of a two-element vector. 
C)  Works by merging two sorted vectors into one larger sorted vector. 
D)  Cannot be implemented recursively. 
A)  Can be used only on vectors of even length. 
B)  Works by reducing vectors down to the base case of a two-element vector. 
C)  Works by merging two sorted vectors into one larger sorted vector. 
D)  Cannot be implemented recursively.

Question 6

A merge sort operation runs in:

Accepted Answer

A)  O(log n) time. 
B)  O(n) time. 
C)  O(n log n) time. 
D)  O(n2) time. 
A)  O(log n) time. 
B)  O(n) time. 
C)  O(n log n) time. 
D)  O(n2) time.

Question 7

At most, how many comparisons are required to search a sorted vector of 1023 elements using the binary search algorithm?

Accepted Answer

A)  10 
B)  15 
C)  20 
D)  30 
A)  10 
B)  15 
C)  20 
D)  30

Question 8

Which of the following represents the efficiency of the insertion sort?

Accepted Answer

A)  O(1) 
B)  O(n) 
C)  O(n2) 
D)  None of the above. 
A)  O(1) 
B)  O(n) 
C)  O(n2) 
D)  None of the above.

Question 9

Which of the following statements about searching algorithms and their efficiency is false?

Accepted Answer

A)  The major difference between various searching algorithms is the amount of effort they require to complete the search. 
B)  Big O notation is one way to describe how likely it is that a searching algorithm will find its target. 
C)  The effort required to perform a search or a sort is particularly dependent on the number of data elements. 
D)  A more efficient searching algorithm is usually more complex and difficult to implement. 
A)  The major difference between various searching algorithms is the amount of effort they require to complete the search. 
B)  Big O notation is one way to describe how likely it is that a searching algorithm will find its target. 
C)  The effort required to perform a search or a sort is particularly dependent on the number of data elements. 
D)  A more efficient searching algorithm is usually more complex and difficult to implement.

Question 10

Which of the following is not a valid runtime description according to Big O notation?

Accepted Answer

A)  O(1) 
B)  O(n) 
C)  O(n2) 
D)  All of the above are valid. 
A)  O(1) 
B)  O(n) 
C)  O(n2) 
D)  All of the above are valid.

The first step performed by the binary search algorithm at each iteration is to:

Selection sort has a Big O of:

An algorithm that requires __________ operations to complete its task on n data elements is said to have linear runtime.

The choice of which sorting algorithm to use does not affect:

The merge sort algorithm:

A merge sort operation runs in:

At most, how many comparisons are required to search a sorted vector of 1023 elements using the binary search algorithm?

Which of the following represents the efficiency of the insertion sort?

Which of the following statements about searching algorithms and their efficiency is false?

Which of the following is not a valid runtime description according to Big O notation?

Introduction to Computers and C++

Introduction to C Programming; Inputoutput and Operators

Introduction to Classes, Objects and Strings

Control Statements, Assignment, and Operators

Control Statements, Logical Operators

Functions and an Introduction to Recursion

Class Templates Array and Vector; Catching Exceptions

Pointers and Pointer-Based Strings

Classes: a Deeper Look; Throwing Exceptions

Operator Overloading; String and Array Objects

Object-Oriented Programming: Inheritance

Object-Oriented Programming: Polymorphism

Stream Inputoutput: a Deeper Look

File Processing

Standard Library Containers and Iterators

Standard Library Algorithms

Exception Handling: a Deeper Look

Introduction to Custom Templates

Custom Templatized Data Structures

Class String and String Stream Processing

Bits, Characters, C Strings and Structs

Other Topics

C++11 Additional Features

Filters

Exam 20: Searching and Sorting

The first step performed by the binary search algorithm at each iteration is to:

Selection sort has a Big O of:

An algorithm that requires __________ operations to complete its task on n data elements is said to have linear runtime.

The choice of which sorting algorithm to use does not affect:

The merge sort algorithm:

A merge sort operation runs in:

At most, how many comparisons are required to search a sorted vector of 1023 elements using the binary search algorithm?

Which of the following represents the efficiency of the insertion sort?

Which of the following statements about searching algorithms and their efficiency is false?

Which of the following is not a valid runtime description according to Big O notation?

Introduction to Computers and C++

Introduction to C Programming; Inputoutput and Operators

Introduction to Classes, Objects and Strings

Control Statements, Assignment, and Operators

Control Statements, Logical Operators

Functions and an Introduction to Recursion

Class Templates Array and Vector; Catching Exceptions

Pointers and Pointer-Based Strings

Classes: a Deeper Look; Throwing Exceptions

Operator Overloading; String and Array Objects

Object-Oriented Programming: Inheritance

Object-Oriented Programming: Polymorphism

Stream Inputoutput: a Deeper Look

File Processing

Standard Library Containers and Iterators

Standard Library Algorithms

Exception Handling: a Deeper Look

Introduction to Custom Templates

Custom Templatized Data Structures

Class String and String Stream Processing

Bits, Characters, C Strings and Structs

Other Topics

C++11 Additional Features

Filters