Binary search works on both sorted and non-sorted arrays.
Answer
True
False
Question 2
Question
With Sequential search having an average O(N) and Binary search having an average O(logN), Which is quicker to use?
Answer
Binary search
none of the above
Question 3
Question
When dividing a list in twos what do you do when its not evenly divided by power of 2?
Answer
A.take the lowest value of 2 you can find
B,find the the numbers that its inbetween
C,take the power of 2 that higher then it
D.none of the above
Question 4
Question
Any linear ordering of all of the vertives in which all the arrows go to the right that is a valid solution.
Answer
True
False
Question 5
Question
if doing a sequential search what is the worst case in terms of big O ?
Answer
A)O(n)
B)O(log n)
C)O(1)
D)O(n/2)
Question 6
Question
Under what condition would the big O for binary search be
1 + log_2(n)?
Answer
a. n is not a power of two
b. the array is not sorted.
c. this would never be the big O
d. none of the above
Question 7
Question
What is the worst-case number of iterations for binary search?
Answer
A) O(log_2 n)
B) O(2 log_2 n)
C) O(n^2)
D) O(n)
Question 8
Question
Sequential(Linear) search may be more suited to keep the array sorted if the user inserts more items than searching for them.
Answer
True
False
Question 9
Question
What is the worst case for a sequential search?
Answer
A. O(N^2)
B. O(N)
C. O(N/2)
D. O(logN)
Question 10
Question
What is a sequential search?
Answer
A) A search that loops through a list and stops if the item is found
B) Using a sorted array, a search that iteratively divides the search partition in half. It looks at the middle element and has three scenarios.
C) None of the above.
Question 11
Question
The worst case for the second algorithm shown during the case study video is:
Answer
A. O(n)
B. O(n log n)
C. O(log n)
D. O(n^2)
Question 12
Question
Which is true of a sequential search and a binary search?
Answer
A. A sequential search needs to be sorted and a binary search does not need to be sorted.
B. A sequential search does not need to be sorted and a binary search needs to be sorted.
C. Both sequential and binary searches need to be sorted.
D. Neither a sequential nor a binary search needs to be sorted.
Question 13
Question
When dealing with smaller numbers of n sequential searching and binary search do not have much difference with growth rate. It is until n gets into the 1000’s that the difference becomes greater.
Answer
True
False
Question 14
Question
The following description of sequential search is T/F ?
sequential search:
loops through a list and stops if the item is found
worst-case is O ( N )
average-case is O ( N/2 ) = O ( N )
best case is O ( 1 )
Answer
True
False
Question 15
Question
If you have a sorted array, which searching alogrithm is better binary or sequential?