Question 1

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

Question 2

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 B

Question 3

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

Question 4

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 5

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 6

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 7

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 8

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 9

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 10

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 11

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 12

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 13

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 14

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 15

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 16

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 17

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 18

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 19

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.

Question 20

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

Exam 19: Searching, Sorting and Big O

What is the efficiency of linear search?

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

Big O notation describes ________.

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

Which of the following sorting algorithms is the fastest?

Which of the following statements is true?

What is the efficiency of selection sort?

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

What does the first pass of selection sort do?

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

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

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

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

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

The linear search algorithm runs in ________time.

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

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

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

Which of the following is a way to sort data?

What is the efficiency of merge sort?

Introduction to Computers and Java

Introduction to Java Applications

Introduction to Classes and Objects

Control Statements: Part 1

Control Statements: Part 2

Methods: a Deeper Look

Arrays and Arraylists

Classes and Objects: a Deeper Look

Object Oriented Programming: Inheritance

Object-Oriented Programming: Polymorphism

Exception Handling

Gui Components: Part 1

Graphics and Java 2D

Strings

Files,streams and Object Serialization

Generic Collections

Lambdas

Recursion

Generic Classes and Methods

Custom Generic Data Structures

Concurrency

Accessing Databases With Jdbc

JavaFX

Filters

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