Question 1

Which of the following sorting algorithms is the fastest?

Accepted Answer

A)  Selection sort. 
B)  Insertion sort. 
C)  Merge sort. 
D)  They all run at roughly the same speed. 
A)  Selection sort. 
B)  Insertion sort. 
C)  Merge sort. 
D)  They all run at roughly the same speed. C

Question 2

Which of the following is a negative of binary search?

Accepted Answer

A)  It requires significantly more memory than linear search. 
B)  It is slower than linear search. 
C)  The data must be in sorted order. 
D)  None of the above. 
A)  It requires significantly more memory than linear search. 
B)  It is slower than linear search. 
C)  The data must be in sorted order. 
D)  None of the above. C

Question 3

Using a binary search, what is the maximum number of comparisons required to find a search key in a 31-element sorted array?

Accepted Answer

A)  4. 
B)  5. 
C)  32. 
D)  1. 
A)  4. 
B)  5. 
C)  32. 
D)  1. B

Question 4

What is the efficiency of linear search?

Accepted Answer

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

Question 5

Big O highlights ________ factors and ignores terms that become unimportant with ________ n values.

Accepted Answer

A)  insignificant, low 
B)  insignificant, high 
C)  dominant, low 
D)  dominant, high 
A)  insignificant, low 
B)  insignificant, high 
C)  dominant, low 
D)  dominant, high

Question 6

How many comparisons will the linear search algorithm make if the search key is not in an array of 10 elements?

Accepted Answer

A)  0. 
B)  10. 
C)  9. 
D)  5. 
A)  0. 
B)  10. 
C)  9. 
D)  5.

Question 7

Different sorting algorithms on a particular array produce the same result; the choice of algorithm affects ________ of the program that implements the algorithm.

Accepted Answer

A)  only the run time 
B)  the run time and the memory use 
C)  only the memory use 
D)  neither the run time nor the memory use 
A)  only the run time 
B)  the run time and the memory use 
C)  only the memory use 
D)  neither the run time nor the memory use

Question 8

What is the efficiency of merge sort?

Accepted Answer

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

Question 9

What is the term used for binary search's run time?

Accepted Answer

A)  Linear run time. 
B)  Quadratic run time. 
C)  Constant run time. 
D)  Logarithmic run time. 
A)  Linear run time. 
B)  Quadratic run time. 
C)  Constant run time. 
D)  Logarithmic run time.

Question 10

Big O notation is concerned with the growth rate of algorithm run times, so ________.

Accepted Answer

A)  constants are dominant 
B)  constants are ignored 
C)  constant terms are emphasized 
D)  constants with large values are more important than those with low values 
A)  constants are dominant 
B)  constants are ignored 
C)  constant terms are emphasized 
D)  constants with large values are more important than those with low values

Question 11

Big O notation describes ________.

Accepted Answer

A)  the amount of memory required by an algorithm. 
B)  the difficulty of writing an algorithm to solve a specific problem. 
C)  an algorithm's efficiency in terms of the work required to solve a problem. 
D)  the length of an algorithm for solving a specific problem. 
A)  the amount of memory required by an algorithm. 
B)  the difficulty of writing an algorithm to solve a specific problem. 
C)  an algorithm's efficiency in terms of the work required to solve a problem. 
D)  the length of an algorithm for solving a specific problem.

Question 12

Which of the following statements is true?

Accepted Answer

A)  The binary search algorithm is less efficient than the linear search, but it requires that the array be sorted. 
B)  The binary search algorithm is more efficient than the linear search, but it requires that the array be unsorted. 
C)  The binary search algorithm is more efficient than the linear search, but it requires that the array be sorted. 
D)  The binary search algorithm is less efficient than the linear search, but it requires that the array be unsorted. 
A)  The binary search algorithm is less efficient than the linear search, but it requires that the array be sorted. 
B)  The binary search algorithm is more efficient than the linear search, but it requires that the array be unsorted. 
C)  The binary search algorithm is more efficient than the linear search, but it requires that the array be sorted. 
D)  The binary search algorithm is less efficient than the linear search, but it requires that the array be unsorted.

Question 13

What does the first pass of selection sort do?

Accepted Answer

A)  Splits the array into two approximately equal pieces. 
B)  Orders the first two elements of the array. 
C)  Partitions the array into two unequal pieces depending on whether each element in the array is greater or less that some pivot element. 
D)  Locates the smallest element in the array and swaps it into the zeroth position. 
A)  Splits the array into two approximately equal pieces. 
B)  Orders the first two elements of the array. 
C)  Partitions the array into two unequal pieces depending on whether each element in the array is greater or less that some pivot element. 
D)  Locates the smallest element in the array and swaps it into the zeroth position.

Question 14

What is the base case for the recursive merge sort algorithm?

Accepted Answer

A)  Any array that is already sorted. 
B)  A two-element array. 
C)  A one-element array. 
D)  A zero-element array. 
A)  Any array that is already sorted. 
B)  A two-element array. 
C)  A one-element array. 
D)  A zero-element array.

Question 15

What is the efficiency of selection sort?

Accepted Answer

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

Question 16

What does each iteration of the insertion sort algorithm do?

Accepted Answer

A)  Each iteration takes the next smallest element and inserts it at the beginning of the array. 
B)  Each iteration takes the next element in the unsorted portion of the array and inserts it into the sorted portion. 
C)  Sorted subarrays are inserted into the larger array. 
D)  Each iteration determines the location of a pivot and inserts it into place. 
A)  Each iteration takes the next smallest element and inserts it at the beginning of the array. 
B)  Each iteration takes the next element in the unsorted portion of the array and inserts it into the sorted portion. 
C)  Sorted subarrays are inserted into the larger array. 
D)  Each iteration determines the location of a pivot and inserts it into place.

Question 17

Which of the following is not a name for a big O run time?

Accepted Answer

A)  Constant run time. 
B)  Variable run time. 
C)  Linear run time. 
D)  Quadratic run time. 
A)  Constant run time. 
B)  Variable run time. 
C)  Linear run time. 
D)  Quadratic run time.

Question 18

The linear search algorithm runs in ________time.

Accepted Answer

A)  quadratic 
B)  O(n) 
C)  constant 
D)  nonlinear 
A)  quadratic 
B)  O(n) 
C)  constant 
D)  nonlinear

Question 19

A searching algorithm that's O(1)________.

Accepted Answer

A)  requires one comparison 
B)  does not necessarily require only one comparison 
C)  can search only an array of one item. 
D)  None of the above. 
A)  requires one comparison 
B)  does not necessarily require only one comparison 
C)  can search only an array of one item. 
D)  None of the above.

Question 20

Which of the following is a way to sort data?

Accepted Answer

A)  Alphabetically. 
B)  In increasing numerical order. 
C)  Based on an account number. 
D)  All of the above. 
A)  Alphabetically. 
B)  In increasing numerical order. 
C)  Based on an account number. 
D)  All of the above.

Exam 19: Searching, Sorting and Big O

Which of the following sorting algorithms is the fastest?

Which of the following is a negative of binary search?

Using a binary search, what is the maximum number of comparisons required to find a search key in a 31-element sorted array?

What is the efficiency of linear search?

Big O highlights ________ factors and ignores terms that become unimportant with ________ n values.

How many comparisons will the linear search algorithm make if the search key is not in an array of 10 elements?

Different sorting algorithms on a particular array produce the same result; the choice of algorithm affects ________ of the program that implements the algorithm.

What is the efficiency of merge sort?

What is the term used for binary search's run time?

Big O notation is concerned with the growth rate of algorithm run times, so ________.

Big O notation describes ________.

Which of the following statements is true?

What does the first pass of selection sort do?

What is the base case for the recursive merge sort algorithm?

What is the efficiency of selection sort?

What does each iteration of the insertion sort algorithm do?

Which of the following is not a name for a big O run time?

The linear search algorithm runs in ________time.

A searching algorithm that's O(1)________.

Which of the following is a way to sort data?

Introduction to Computers and Java

Introduction to Java Applications

Control Statements

Control Statements

Methods

Arrays and Arraylists

Introduction to Classes and Objects

Classes and Objects: a Deeper Look

Object Oriented Programming: Inheritance

Object-Oriented Programming: Polymorphism

Exception Handling

Gui Components

Graphics and Java 2D

Fundamentals of Characters and Strings

Files, Streams and Object Serialization

Generic Collections

Lambdas

Recursion

Generic Classes and Methods

Custom Generic Data Structures

GUI

Concurrency

Accessing Databases With JDBC

JavaFX

Filters

Big O highlights factors and ignores terms that become unimportant with n values.