Question 1

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. D

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

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

Question 4

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

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 6

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.

Question 7

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 8

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 9

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 10

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 11

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 12

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 13

An O(n) algorithm is referred to as having a _______ run time.

Accepted Answer

A)  constant 
B)  linear 
C)  quadratic 
D)  negative 
A)  constant 
B)  linear 
C)  quadratic 
D)  negative

Question 14

How much faster is insertion sort with a 15-element array than with a 60-element array?

Accepted Answer

A)  60 times. 
B)  4 times. 
C)  15 times. 
D)  19 times. 
A)  60 times. 
B)  4 times. 
C)  15 times. 
D)  19 times.

Question 15

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 16

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 17

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.

Question 18

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 19

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 20

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.

Exam 19: Searching, Sorting and Big O

Which of the following is a way to sort data?

Which of the following is a negative of binary search?

Which of the following statements is true?

is the efficiency of linear search?

What does each iteration of the insertion sort algorithm do?

Which of the following sorting algorithms is the fastest?

What is the efficiency of merge sort?

What does the first pass of selection sort do?

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

The linear search algorithm runs in ________time.

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

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

An O(n) algorithm is referred to as having a _______ run time.

How much faster is insertion sort with a 15-element array than with a 60-element array?

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

What is the efficiency of selection sort?

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

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.

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

Introduction to Computers, the Internet and Java

Introduction to Java Applications; Inputoutput and Operators

Introduction to Classes, Objects, Methods and Strings

Control Statements: Assignment, and Operators

Control Statements: Logical Operators

Methods: a Deeper Look

Arrays and Arraylists

Classes and Objects: a Deeper Look

Object-Oriented Programming: Inheritance

Object-Oriented Programming: Polymorphism and Interfaces

Exception Handling: a Deeper Look

Javafx Graphical User Interfaces

Javafx Gui

Strings, Characters and Regular Expressions

Files, Inputoutput Streams, Nio and Xml Serialization

Generic Collections

Lambdas and Streams

Recursion

Generic Classes and Methods: a Deeper Look

Custom Generic Data Structures

Concurrency

Accessing Databases With Jdbc

Swing Gui Components

Graphics and Java 2d

Networking

Java Persistence Api Jpa

Javaserver Faces Web Apps

Javaserver Faces Web Apps

Swing Gui Components

Filters

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