Question 1

Write a method that accepts an integer and an array of integers, and returns true if the integer is contained in the array. You may assume that the array is sorted, and your method should use a binary search..

Accepted Answer

public boolean binarySearch(int a, int[] array) {
int first = 0;
int last = array.length-1;
int mid;
while(first <= last) {
mid = (first+last)/2;
if(array[mid] == a)
return true;
else if(array[mid] > a)
last = mid - 1;
else
last = mid + 1;
}
return false;
}

Question 2

____________________ is the process of arranging a group of items into a defined order.

Accepted Answer

A)   Searching
B)   Sorting
C)   Selecting
D)   Helping
E)   none of the above B

Question 3

How many times will the following code print out Hello World (in terms of the length of the array)?
for(int i = 0; i < array.length; i++) {
for(int j = 0; j < array.length; j++) {
for(int k = 0; k < array.length; k++) {
System.out.println("Hello World!");
}
}
}

Accepted Answer

The answer of How many times will the following code...

Question 4

Write a method that accepts an integer and an array of integers, and returns true if the integer is contained in the array. The method should use a linear search.

Accepted Answer

The answer of Write a method that accepts an integer...

Question 5

Explain why a faster computer can never make an exponential time algorithm run faster than a polynomial time algorithm on all inputs.

Accepted Answer

The answer of Explain why a faster computer can never...

Question 6

_____________________ is the process of finding a designated target element within a group of items.

Accepted Answer

A)   Sorting
B)   Searching
C)   Recursing
D)   Helping
E)   none of the above

Question 7

What is the complexity of the following code (in terms of the length of the array), assuming someMethod has a complexity of O(1)?
for(int i = 0; i < array.length; i++)
for(int j = 0; j < array.length; j++)
someMethod(array[j]);

Accepted Answer

The answer of What is the complexity of the following...

Question 8

As the number of items in a search pool grows, the number of comparisons required to search _______________ .

Accepted Answer

A)   increases
B)   decreases
C)   stays the same
D)   goes to 0
E)   none of the above

Question 9

Write out the state while being sorted using the insertion sort algorithm:

Accepted Answer

The answer of Write out the state while being sorted...

Question 10

Which of the following is not a sorting algorithm?

Accepted Answer

A)   Bubble sort
B)   Quick sort
C)   Merge sort
D)   Selection sort
E)   all of the above are sorting algorithms

Question 11

Explain what O(1) means.

Accepted Answer

The answer of Explain what O(1) means....

Question 12

Which of the following algorithms has a time complexity of O(log2 n)?

Accepted Answer

A)   insertion sort
B)   selection sort
C)   bubble sort
D)   linear search
E)   binary search

Question 13

A linear search is more efficient than a binary search.

Accepted Answer

A) True 
 B)False

Question 14

Bubble sort is the most efficient searching algorithm.

Accepted Answer

A) True 
 B)False

Question 15

Suppose we have algorithms that solve a particular problem that have the following complexities. Which one is most efficient?

Accepted Answer

A)   O(1) 
B)   O(log2n) 
C)   O(n2) 
D)   O(n3) 
E)   O(2n)

Question 16

In the binary search algorithm, if the number of elements in the search pool is even, which value is used as the midpoint? Explain.

Accepted Answer

The answer of In the binary search algorithm, if the...

Question 17

A _______________ search is more efficient than a linear search.

Accepted Answer

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

Question 18

Suppose we would like to swap the elements at index i and index j in an array. Does the following code work? If so, explain how. If not, explain why it fails.
array[i] = array[j];
array[j] = array[i];

Accepted Answer

The answer of Suppose we would like to swap the...

Question 19

A __________________ search looks through the search pool one element at a time.

Accepted Answer

A)   binary
B)   clever
C)   insertion
D)   selection
E)   linear

Question 20

The ___________________ algorithm sorts values by repeatedly comparing neighboring elements in the list and swapping their position if the are not in order relative to each other.

Accepted Answer

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

Exam 12: Searching and Sorting

Write a method that accepts an integer and an array of integers, and returns true if the integer is contained in the array. You may assume that the array is sorted, and your method should use a binary search..

____________________ is the process of arranging a group of items into a defined order.

How many times will the following code print out Hello World (in terms of the length of the array)? for(int i = 0; i < array.length; i++) { for(int j = 0; j < array.length; j++) { for(int k = 0; k < array.length; k++) { System.out.println("Hello World!"); } } }

Write a method that accepts an integer and an array of integers, and returns true if the integer is contained in the array. The method should use a linear search.

Explain why a faster computer can never make an exponential time algorithm run faster than a polynomial time algorithm on all inputs.

_____________________ is the process of finding a designated target element within a group of items.

What is the complexity of the following code (in terms of the length of the array), assuming someMethod has a complexity of O(1)? for(int i = 0; i < array.length; i++) for(int j = 0; j < array.length; j++) someMethod(array[j]);

As the number of items in a search pool grows, the number of comparisons required to search _______________ .

Write out the state while being sorted using the insertion sort algorithm:

Which of the following is not a sorting algorithm?

Explain what O(1) means.

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

A linear search is more efficient than a binary search.

Bubble sort is the most efficient searching algorithm.

Suppose we have algorithms that solve a particular problem that have the following complexities. Which one is most efficient?

In the binary search algorithm, if the number of elements in the search pool is even, which value is used as the midpoint? Explain.

A _______________ search is more efficient than a linear search.

Suppose we would like to swap the elements at index i and index j in an array. Does the following code work? If so, explain how. If not, explain why it fails. array[i] = array[j]; array[j] = array[i];

A __________________ search looks through the search pool one element at a time.

The ___________________ algorithm sorts values by repeatedly comparing neighboring elements in the list and swapping their position if the are not in order relative to each other.

Exam 12: Searching and Sorting

Write a method that accepts an integer and an array of integers, and returns true if the integer is contained in the array. You may assume that the array is sorted, and your method should use a binary search..

____________________ is the process of arranging a group of items into a defined order.

How many times will the following code print out Hello World (in terms of the length of the array)? for(int i = 0; i < array.length; i++) { for(int j = 0; j < array.length; j++) { for(int k = 0; k < array.length; k++) { System.out.println("Hello World!"); } } }

Write a method that accepts an integer and an array of integers, and returns true if the integer is contained in the array. The method should use a linear search.

Explain why a faster computer can never make an exponential time algorithm run faster than a polynomial time algorithm on all inputs.

_____________________ is the process of finding a designated target element within a group of items.

What is the complexity of the following code (in terms of the length of the array), assuming someMethod has a complexity of O(1)? for(int i = 0; i < array.length; i++) for(int j = 0; j < array.length; j++) someMethod(array[j]);

As the number of items in a search pool grows, the number of comparisons required to search _______________ .

Write out the state while being sorted using the insertion sort algorithm:

Which of the following is not a sorting algorithm?

Explain what O(1) means.

Which of the following algorithms has a time complexity of O(log2 n) ?

A linear search is more efficient than a binary search.

Bubble sort is the most efficient searching algorithm.

Suppose we have algorithms that solve a particular problem that have the following complexities. Which one is most efficient?

In the binary search algorithm, if the number of elements in the search pool is even, which value is used as the midpoint? Explain.

A _______________ search is more efficient than a linear search.

Suppose we would like to swap the elements at index i and index j in an array. Does the following code work? If so, explain how. If not, explain why it fails. array[i] = array[j]; array[j] = array[i];

A __________________ search looks through the search pool one element at a time.

The ___________________ algorithm sorts values by repeatedly comparing neighboring elements in the list and swapping their position if the are not in order relative to each other.

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