Consider the following questions regarding the JAVA langauge.
1. The worst case in linear search is that every element must be checked to determine whether the search key exists, which occurs if the search key ..... (pick one)
a. is the last array element
b. is not present
c. is the last array element or is not present
d. none of the above
2. How many comparisons will the linear search algorithm make if the search key is not in an array of 10 elements?
3. Which of the following is true? (pick one)
a. The binary search algorithm is less efficient than the linear search, but it requires that the array be sorted.
b. The binary search algorithm is more efficient than the linear search, but it requires that the array be unsorted.
c. The binary search algorithm is more efficient than the linear search, but it requires that the array be sorted.
d. The binary search algorithm is less efficient than the linear search, but it requires that the array be unsorted.
4. Which of the following is a drawback of binary search? (pick any that apply)
a. it requires significantly more memory than linear search.
b. the data must be in sorted order
c. it is slower (less efficient) than linear search
5. What is the term used for binary search\'s run time? (pick one)
a. constant
b. quadratic
c. linear
d. logarithmic
e. negative
Solution
1. c. is the last array element or is not present
2. 10 comparisons.
3. c. The binary search algorithm is more efficient than the linear search, but it requires that the array be sorted.
4. b. the data must be in sorted order.
5. d. logarithmic
.
Consider the following questions regarding the JAVA langauge- 1- The w.docx
1. Consider the following questions regarding the JAVA langauge.
1. The worst case in linear search is that every element must be checked to determine whether
the search key exists, which occurs if the search key ..... (pick one)
a. is the last array element
b. is not present
c. is the last array element or is not present
d. none of the above
2. How many comparisons will the linear search algorithm make if the search key is not in an
array of 10 elements?
3. Which of the following is true? (pick one)
a. The binary search algorithm is less efficient than the linear search, but it requires that the array
be sorted.
b. The binary search algorithm is more efficient than the linear search, but it requires that the
array be unsorted.
c. The binary search algorithm is more efficient than the linear search, but it requires that the
array be sorted.
d. The binary search algorithm is less efficient than the linear search, but it requires that the array
be unsorted.
4. Which of the following is a drawback of binary search? (pick any that apply)
a. it requires significantly more memory than linear search.
b. the data must be in sorted order
c. it is slower (less efficient) than linear search
5. What is the term used for binary search's run time? (pick one)
a. constant
b. quadratic
c. linear
2. d. logarithmic
e. negative
Solution
1. c. is the last array element or is not present
2. 10 comparisons.
3. c. The binary search algorithm is more efficient than the linear search, but it requires that the
array be sorted.
4. b. the data must be in sorted order.
5. d. logarithmic
