Question 1

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

Accepted Answer

A)  How thoroughly 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 thoroughly 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

Question 2

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

Accepted Answer

A)  O1) 
B)  On) 
C)  On2) 
D)  All of the above are valid. 
A)  O1) 
B)  On) 
C)  On2) 
D)  All of the above are valid. D

Question 3

The merge sort algorithm:

Accepted Answer

A)  Can only be used 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 only be used 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. C

Question 4

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 5

An algorithm that requires __________ operations to complete its task on n data elements is said to have a 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

Question 6

A merge sort operation runs in:

Accepted Answer

A)  Olog n) time. 
B)  On) time. 
C)  On log n) time. 
D)  On2) time. 
A)  Olog n) time. 
B)  On) time. 
C)  On log n) time. 
D)  On2) time.

Question 7

Which of the following is not true about searching algorithms and their efficiency?

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 8

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

Accepted Answer

A)  O1) 
B)  On) 
C)  On2) 
D)  None of the above. 
A)  O1) 
B)  On) 
C)  On2) 
D)  None of the above.

Question 9

Selection sort has a Big O of:

Accepted Answer

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

Question 10

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.

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

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

The merge sort algorithm:

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

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

A merge sort operation runs in:

Which of the following is not true about searching algorithms and their efficiency?

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

Selection sort has a Big O of:

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

Introduction to Computers, the Internet and the World Wide Web

Introduction to C Programming

Control Statements, Part 1

Control Statements, Part 2

Functions and an Introduction to Recursion

Arrays and Vectors

Pointers and Pointer-Based Strings

Sequential-Access Files

Classes

Classes: a Deeper Look, Part 2

Operator Overloading; String and Array Objects

Object-Oriented Programming: Inheritance

Object-Oriented Programming: Polymorphism

Templates

Stream Inputoutput

Exception Handling

File Processing

Class String and String Stream Processing

Data Structures

Standard Template Library Stl

Bits, Characters, C Strings and Structs

Boost Libraries, Technical Report 1 and C0x

Other Topics

ATM Case Study, Part 1: Object-Oriented Design With the Uml

ATM Case Study, Part 2: Implementing an Object-Oriented Design

Game Programming With Ogre

Filters

Exam 19: Searching and Sorting

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

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

The merge sort algorithm:

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

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

A merge sort operation runs in:

Which of the following is not true about searching algorithms and their efficiency?

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

Selection sort has a Big O of:

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

Introduction to Computers, the Internet and the World Wide Web

Introduction to C Programming

Control Statements, Part 1

Control Statements, Part 2

Functions and an Introduction to Recursion

Arrays and Vectors

Pointers and Pointer-Based Strings

Sequential-Access Files

Classes

Classes: a Deeper Look, Part 2

Operator Overloading; String and Array Objects

Object-Oriented Programming: Inheritance

Object-Oriented Programming: Polymorphism

Templates

Stream Inputoutput

Exception Handling

File Processing

Class String and String Stream Processing

Data Structures

Standard Template Library Stl

Bits, Characters, C Strings and Structs

Boost Libraries, Technical Report 1 and C0x

Other Topics

ATM Case Study, Part 1: Object-Oriented Design With the Uml

ATM Case Study, Part 2: Implementing an Object-Oriented Design

Game Programming With Ogre

Filters