Java: Chapter 20 Exam

What kind of data can be sorted by the Bubble, Selection, and Insertion sort algorithms?

• All of these can be sorted

• Numbers

• Strings

• Other objects

Which sorting algorithm relies on swapping pairs of side-by-side elements that are out of order?

• Selection sort

• Insertion sort

• Merge sort

• Bubble sort

Which sorting algorithm iterates through the array, starting one element to the right each time. On each iteration, it scans all elements to the right of the starting point for a smaller value, and swaps it with the starting position if found.

• Bubble sort

• Selection sort

• Insertion sort

• Merge sort

Which sorting algorithm makes a single pass through the array, starting at the second element, and moving that element backward while the numbers to the left are greater?

• Bubble sort

• Selection sort

• Insertion sort

• Merge sort

If the Bubble Sort algorithm begins working on an array with "N" elements that is already completely sorted, how many loops will it need to complete over the entire array?

• 1

• 0

• N

• N / 2

Given the starting values below, what will the order become after the first complete pass through the array by the Bubble Sort algorithm? { 4, 1, 8, 5 }

• 5, 1, 4, 8

• 1, 5, 8, 4

• 1, 4, 5, 8

• 8, 1, 4, 5

What is one simple way to understand the efficiency of an algorithm?

• All of these will work equally well

• Do a rough statement execution count, focusing on the innermost loop

• Calculate the amount of memory that will be consumed during the algorithm

• Look at the size of the compiled .class file that contains the Java algorithm

How would you change an algorithm that uses a simple 1D array to use an ArrayList instead?

• Replace simple array tasks like getting or setting values or finding the array length with the equivalent methods on the ArrayList

• Both of these steps should be taken

• If the simple array contains primitive values, use the corresponding Java wrapper classes in the ArrayList

• Neither of these steps should be taken

On each pass, when the Selection sort scans the array to the right of the starting position, what is it looking for?

• Any of these could be true, depending on how the initial data is stored

• The largest number to the right

• A number that matches the value at the starting point

• The smallest number to the right

Given the starting values below, what will the order become after the first complete pass through the array by the Selection Sort algorithm? { 4, 1, 8, 5 }

• 1, 8, 4, 5

• 1, 4, 8, 5

• 4, 1, 5, 8

• 5, 1, 4, 8