Question 1

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

Question 2

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

Question 3

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

Question 4

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 5

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 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 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 8

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

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 11

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.

Question 12

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 13

What is the maximum number of comparisons required to find a search key in a 31-element array?

Accepted Answer

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

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.

Exam 19: Searching, Sorting and Big O

What does the first pass of selection sort do?

What is the efficiency of merge sort?

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

What does each iteration of the insertion sort algorithm do?

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

Which of the following sorting algorithms is the fastest?

What is the efficiency of linear search?

Which of the following is a way to sort data?

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

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

Which of the following is a negative of binary search?

What is the efficiency of selection sort?

What is the maximum number of comparisons required to find a search key in a 31-element array?

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

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

Atm Case Study,part 1: Object-Oriented Design With the Uml

Atm Case Study,part 2: Implementing an Object-Oriented Design

Gui Components: Part 1

Graphics and Java 2d

Strings

Files,streams and Object Serialization

Recursion

Generic Collections

Generic Classes and Methods

Custom Generic Data Structures

Applets and Java Web Start

Multimedia: Applets and Applications

Gui, Part 2

Multithreading

Networking

Accessing Databases With Jdbc

Java Server Faces Web Applications

Ajax-Enabled Jsf Web Applications

Web Services

Filters