Question 1

Which of the following algorithms has a worst case complexity of O(n log2n)?

Accepted Answer

A)  insertion sort 
B)  selection sort 
C)  bubble sort 
D)  merge sort 
E)  none of the above 
A)  insertion sort 
B)  selection sort 
C)  bubble sort 
D)  merge sort 
E)  none of the above

Question 2

The __________________ algorithm sorts a list of values by repetitively inserting a particular value into a subset of the list that has already been sorted.

Accepted Answer

A)  insertion sort 
B)  selection sort 
C)  bubble sort 
D)  quick sort 
E)  merge sort 
A)  insertion sort 
B)  selection sort 
C)  bubble sort 
D)  quick sort 
E)  merge sort

Question 3

Write out the state of the list while being sorted using the selection sort algorithm:

Accepted Answer

1 6 3 55 110 8 93 703
1 3 6 55

Question 4

A linear search always requires more comparisons than a binary search.

Accepted Answer

A) True 
 B)False

Question 5

Write a method that accepts an integer array as a parameter and sorts it using the bubble sort algorithm.

Accepted Answer

public void bubbleSort(int[] array) {
in

Question 6

Quick sort works by separating a list into two lists, and recursively sorting the two lists using quick sort.

Accepted Answer

A) True 
 B)False

Question 7

Explain how merge sort works.

Accepted Answer

Merge sort works by dividing the list in

Question 8

If there are more items in a search pool, then it will typically require more comparisons to find an item.

Accepted Answer

A) True 
 B)False

Question 9

Which of the following algorithms is most easily expressed recursively?

Accepted Answer

A)  linear search 
B)  quick sort 
C)  bubble sort 
D)  selection sort 
E)  none of the above algorithms are easily expressible recursively 
A)  linear search 
B)  quick sort 
C)  bubble sort 
D)  selection sort 
E)  none of the above algorithms are easily expressible recursively

Question 10

What is the complexity of the following code (in terms of the length of the array)?
for(int i = 0; i < 5; i++)
System.out.println(array[i]);

Accepted Answer

The complexity of th

Question 11

Which of the following algorithms has a worst-case complexity of O(n2)?

Accepted Answer

A)  insertion sort 
B)  selection sort 
C)  bubble sort 
D)  all of the above 
E)  neither a, b, nor c 
A)  insertion sort 
B)  selection sort 
C)  bubble sort 
D)  all of the above 
E)  neither a, b, nor c

Question 12

With each comparison, a binary search eliminates approximately half of the items remaining in the search pool.

Accepted Answer

A) True 
 B)False

Question 13

Explain how quick sort works.

Accepted Answer

Quick sort works by first selecting a pi

Question 14

Every algorithm for a problem has the same efficiency.

Accepted Answer

A) True 
 B)False

Question 15

In a binary search, _______________________________ .

Accepted Answer

A)  it is assumed that all of the elements are integers. 
B)  it is assumed that all of the elements are Strings. 
C)  it is assumed that the search pool is small. 
D)  it is assumed that the search pool is ordered. 
E)  it is assumed that the search pool is large. 
A)  it is assumed that all of the elements are integers. 
B)  it is assumed that all of the elements are Strings. 
C)  it is assumed that the search pool is small. 
D)  it is assumed that the search pool is ordered. 
E)  it is assumed that the search pool is large.

Question 16

Write a method that accepts an array of integers as a parameter and sorts them using the selection sort algorithm.

Accepted Answer

public void selectionSort(int [] array)

Question 17

Bubble sort works by separating a list into two lists, recursively sorting the two lists using bubble sort, and then combining the sorted sublists into a sorted list.

Accepted Answer

A) True 
 B)False

Question 18

The ___________________ of an algorithm shows the relationship between the size of the problem and the value we hope to optimize.

Accepted Answer

A)  growth function 
B)  growth analysis 
C)  size function 
D)  size analysis 
E)  none of the above 
A)  growth function 
B)  growth analysis 
C)  size function 
D)  size analysis 
E)  none of the above

Question 19

To represent constant time complexity we use O(c).

Accepted Answer

A) True 
 B)False

Question 20

The selection sort algorithm sorts a list of values by repeatedly putting a particular value into its final, sorted position.

Accepted Answer

A) True 
 B)False

Which of the following algorithms has a worst case complexity of O(n log₂n)?

The __________________ algorithm sorts a list of values by repetitively inserting a particular value into a subset of the list that has already been sorted.

Write out the state of the list while being sorted using the selection sort algorithm:

A linear search always requires more comparisons than a binary search.

Write a method that accepts an integer array as a parameter and sorts it using the bubble sort algorithm.

Quick sort works by separating a list into two lists, and recursively sorting the two lists using quick sort.

Explain how merge sort works.

If there are more items in a search pool, then it will typically require more comparisons to find an item.

Which of the following algorithms is most easily expressed recursively?

What is the complexity of the following code (in terms of the length of the array)? for(int i = 0; i < 5; i++) System.out.println(array[i]);

Which of the following algorithms has a worst-case complexity of O(n²)?

With each comparison, a binary search eliminates approximately half of the items remaining in the search pool.

Explain how quick sort works.

Every algorithm for a problem has the same efficiency.

In a binary search, _______________________________ .

Write a method that accepts an array of integers as a parameter and sorts them using the selection sort algorithm.

Bubble sort works by separating a list into two lists, recursively sorting the two lists using bubble sort, and then combining the sorted sublists into a sorted list.

The ___________________ of an algorithm shows the relationship between the size of the problem and the value we hope to optimize.

To represent constant time complexity we use O(c).

The selection sort algorithm sorts a list of values by repeatedly putting a particular value into its final, sorted position.

Introduction

Data and Expressions

Using Classes and Objects

Conditionals and Loops

Writing Classes

Graphical User Interfaces

Arrays

Inheritance

Polymorphism

Recursion

Exceptions

Trees

Introduction to Collections and Stacks

Heaps and Priority Queues

Graphs

Filters

Exam 12: Searching and Sorting

Which of the following algorithms has a worst case complexity of O(n log2n)?

The __________________ algorithm sorts a list of values by repetitively inserting a particular value into a subset of the list that has already been sorted.

Write out the state of the list while being sorted using the selection sort algorithm:

A linear search always requires more comparisons than a binary search.

Write a method that accepts an integer array as a parameter and sorts it using the bubble sort algorithm.

Quick sort works by separating a list into two lists, and recursively sorting the two lists using quick sort.

Explain how merge sort works.

If there are more items in a search pool, then it will typically require more comparisons to find an item.

Which of the following algorithms is most easily expressed recursively?

What is the complexity of the following code (in terms of the length of the array)? for(int i = 0; i < 5; i++) System.out.println(array[i]);

Which of the following algorithms has a worst-case complexity of O(n2)?

With each comparison, a binary search eliminates approximately half of the items remaining in the search pool.

Explain how quick sort works.

Every algorithm for a problem has the same efficiency.

In a binary search, _______________________________ .

Write a method that accepts an array of integers as a parameter and sorts them using the selection sort algorithm.

Bubble sort works by separating a list into two lists, recursively sorting the two lists using bubble sort, and then combining the sorted sublists into a sorted list.

The ___________________ of an algorithm shows the relationship between the size of the problem and the value we hope to optimize.

To represent constant time complexity we use O(c).

The selection sort algorithm sorts a list of values by repeatedly putting a particular value into its final, sorted position.

Introduction

Data and Expressions

Using Classes and Objects

Conditionals and Loops

Writing Classes

Graphical User Interfaces

Arrays

Inheritance

Polymorphism

Recursion

Exceptions

Trees

Introduction to Collections and Stacks

Heaps and Priority Queues

Graphs

Filters

Which of the following algorithms has a worst case complexity of O(n log₂n)?

Which of the following algorithms has a worst-case complexity of O(n²)?