# Data Structure Quiz 1.2

### Data Structure Quiz 1.2

Binary search is ____ type of search.
a. Address calculation search
b. A and B
c. Non linear search
d. Linear search

Binary search tree is a ___ type of search
a. graph search
b. Just tree search
c. None
d. multi-way tree search

What is the worst case complexity of binary search using recursion?
a. O(n^2)
b. O(nlogn)
c. O(logn)
d. O

In linear search with array, how many comparisons are needed in average case?
a. 1
b. 0
c. n
d. n+1/2

Finding an element, whether that is present in a list or not. It is called__
a. Sorting
b. none
c. Searching
d. Storing

In the following type of searching key-comparisons are needed
a. Non linear search
b. Address calculation search
c. A and B
d. Linear search

In linear search with array, how many comparisons are needed in worst case?
a. 1
b. n/2
c. n
d. 0

Asymptotic complexity of linear search with array in average case is
a. O
b. logn
c. O(n/2)
d. O(1)

The following type of search is easy to implement.
a. Interpolation
b. none
c. Linear search
d. Non linear search

In linear search with array, how many comparisons are needed in best case?
a. 0
b. n
c. 1
d. n/2