Question 1

Suppose an algorithm requires a total of 3n3 + 2n2 - 3n + 4 visits.In big-Oh notation, the total number of visits is of what order?

Accepted Answer

A) n2 * n2 
B) n2 
C) n3 
D) n6

Question 2

Consider an array with n elements.If we visit each element n times, how many total visits will there be?

Accepted Answer

A) nn 
B) n 
C) 2n 
D) n2

Question 3

How many times can an array with 4,096 elements be cut into two equal pieces?

Accepted Answer

A) 10 
B) 8 
C) 16 
D) 12

Question 4

An algorithm that tests whether the first array element is equal to any of the other array elements would be an ____ algorithm.

Accepted Answer

A) O(n log (n)) 
B) O(log (n)) 
C) O(1) 
D) O(n)

Question 5

What type of algorithm places elements in order?

Accepted Answer

A) deletion 
B) searching 
C) sorting 
D) insertion

Question 6

Consider the sort method for selection sort shown below:  Suppose we modify the loop control to read int i = 1; i < a.length - 1; i++.What would be the result?

Accepted Answer

A) The sort would still work correctly. 
B) The sort would not consider the first array element. 
C) An exception would occur 
D) The sort would not consider the last array element.

Question 7

Which function has a faster growth rate: θ(n1/2) or θ(log(n))?

Accepted Answer

A) θ(n1/2) 
B) θ(log(n)) 
C) They can't be compared. 
D) They are the same.

Question 8

If you increase the size of a dataset fivefold, how much longer does it take to sort it with the selection sort algorithm?

Accepted Answer

A) Approximately 100 times longer 
B) Approximately 5 times longer 
C) Approximately 20 times longer 
D) Approximately 25 times longer

Question 9

The analysis for the number of visits in a binary search begins with the equation,
T(n) = T(n / 2) + 1.What does the number 1 represent in this equation?

Accepted Answer

A) The fact that the number of elements is odd. 
B) The total number of recursions required. 
C) The fact that we search either the left half or the right half, but not both. 
D) One element visit before a recursive call on one half of the array.

Question 10

Which of the sorts in the textbook can be characterized by the fact that the best case will have a running time of θ(n) if the data is already sorted?
i.quicksort
II.selection sort
III.insertion sort

Accepted Answer

A) III only 
B) II only 
C) I only 
D) I and III only

Question 11

A binary search is generally ____ a linear search.

Accepted Answer

A) faster than 
B) less efficient than 
C) slower than 
D) equal to

Question 12

After 9 iterations of selection sort working on an array of 10 elements, what must hold true?

Accepted Answer

A) The largest element is correctly placed by default. 
B) The largest element is incorrectly placed. 
C) One more iteration is needed to complete the sort. 
D) The smallest element is incorrectly placed.

Question 13

Suppose we are using binary search on an array with approximately 1,000,000 elements.How many visits should we expect to make in the worst case?

Accepted Answer

A) 16 
B) 30 
C) 20 
D) 1

Question 14

Assume that bands is an ArrayList of String objects, which contains a number of elements in ascending order.Select a statement to complete the code segment below, which invokes the Java library binarySearch method to search for the string "Beatles".If the list does not already contain the string, it should be inserted in an appropriate location so that the list remains sorted.

Accepted Answer

A) bands.add(-1 * index, "Beatles"); 
B) bands.add(-1 - index, "Beatles"); 
C) bands.add(-1 * index + 1, "Beatles"); 
D) bands.add(index + 1, "Beatles");

Question 15

A portion of your program implements a loop over n elements in which each step contains a fixed number of actions.What can you conclude about the running time of this section of code?

Accepted Answer

A) Its running time will be O(n2). 
B) Its running time will be O(log (n)). 
C) Its running time will be O(n log (n)). 
D) Its running time will be O(n).

Question 16

Which sort algorithm is used in the sort method in the Java Arrays class when the array length is less than 7?

Accepted Answer

A) merge sort 
B) quicksort 
C) selection sort 
D) insertion sort

Question 17

The sort method of the Arrays class sorts arrays containing objects of classes that implement the ____ interface.

Accepted Answer

A) Ordered 
B) Sortable 
C) Array 
D) Comparable

Question 18

A portion of your program includes the loops shown in the code snippet below to examine the elements of two arrays, arr1 and arr2, both of length n:  What can you conclude about the running time of this section of code?

Accepted Answer

A) Its running time will be O(log (n)). 
B) Its running time will be O(n). 
C) Its running time will be O(n log (n)). 
D) Its running time will be O(n2).

Question 19

The number of element visits for merge sort totals n + 5n log2 n.Which of the following is the appropriate big-Oh notation for merge sort?

Accepted Answer

A) n log2 n 
B) n+ log2 n 
C) n+ 5n 
D) 5n log2 n

Question 20

The following code is an example of a ___ search.

Accepted Answer

A) binary 
B) sorted 
C) linear 
D) random

Exam 14: Sorting and Searching

Suppose an algorithm requires a total of 3n³ + 2n² - 3n + 4 visits.In big-Oh notation, the total number of visits is of what order?

Consider an array with n elements.If we visit each element n times, how many total visits will there be?

How many times can an array with 4,096 elements be cut into two equal pieces?

An algorithm that tests whether the first array element is equal to any of the other array elements would be an ____ algorithm.

What type of algorithm places elements in order?

Consider the sort method for selection sort shown below: Suppose we modify the loop control to read int i = 1; i < a.length - 1; i++.What would be the result?

Which function has a faster growth rate: θ(n^1/2) or θ(log(n) ) ?

If you increase the size of a dataset fivefold, how much longer does it take to sort it with the selection sort algorithm?

The analysis for the number of visits in a binary search begins with the equation, T(n) = T(n / 2) + 1.What does the number 1 represent in this equation?

Which of the sorts in the textbook can be characterized by the fact that the best case will have a running time of θ(n) if the data is already sorted? i.quicksort II.selection sort III.insertion sort

A binary search is generally ____ a linear search.

After 9 iterations of selection sort working on an array of 10 elements, what must hold true?

Suppose we are using binary search on an array with approximately 1,000,000 elements.How many visits should we expect to make in the worst case?

A portion of your program implements a loop over n elements in which each step contains a fixed number of actions.What can you conclude about the running time of this section of code?

Which sort algorithm is used in the sort method in the Java Arrays class when the array length is less than 7?

The sort method of the Arrays class sorts arrays containing objects of classes that implement the ____ interface.

A portion of your program includes the loops shown in the code snippet below to examine the elements of two arrays, arr1 and arr2, both of length n: What can you conclude about the running time of this section of code?

The number of element visits for merge sort totals n + 5n log₂ n.Which of the following is the appropriate big-Oh notation for merge sort?

The following code is an example of a ___ search.

Exam 14: Sorting and Searching

Suppose an algorithm requires a total of 3n3 + 2n2 - 3n + 4 visits.In big-Oh notation, the total number of visits is of what order?

Consider an array with n elements.If we visit each element n times, how many total visits will there be?

How many times can an array with 4,096 elements be cut into two equal pieces?

An algorithm that tests whether the first array element is equal to any of the other array elements would be an ____ algorithm.

What type of algorithm places elements in order?

Consider the sort method for selection sort shown below: Suppose we modify the loop control to read int i = 1; i < a.length - 1; i++.What would be the result?

Which function has a faster growth rate: θ(n1/2) or θ(log(n) ) ?

If you increase the size of a dataset fivefold, how much longer does it take to sort it with the selection sort algorithm?

The analysis for the number of visits in a binary search begins with the equation, T(n) = T(n / 2) + 1.What does the number 1 represent in this equation?

Which of the sorts in the textbook can be characterized by the fact that the best case will have a running time of θ(n) if the data is already sorted? i.quicksort II.selection sort III.insertion sort

A binary search is generally ____ a linear search.

After 9 iterations of selection sort working on an array of 10 elements, what must hold true?

Suppose we are using binary search on an array with approximately 1,000,000 elements.How many visits should we expect to make in the worst case?

A portion of your program implements a loop over n elements in which each step contains a fixed number of actions.What can you conclude about the running time of this section of code?

Which sort algorithm is used in the sort method in the Java Arrays class when the array length is less than 7?

The sort method of the Arrays class sorts arrays containing objects of classes that implement the ____ interface.

A portion of your program includes the loops shown in the code snippet below to examine the elements of two arrays, arr1 and arr2, both of length n: What can you conclude about the running time of this section of code?

The number of element visits for merge sort totals n + 5n log2 n.Which of the following is the appropriate big-Oh notation for merge sort?

The following code is an example of a ___ search.

Suppose an algorithm requires a total of 3n³ + 2n² - 3n + 4 visits.In big-Oh notation, the total number of visits is of what order?

Which function has a faster growth rate: θ(n^1/2) or θ(log(n) ) ?

The number of element visits for merge sort totals n + 5n log₂ n.Which of the following is the appropriate big-Oh notation for merge sort?