Searching Quiz

Which of the following searching algorithm is fastest when the input array is not sorted but has uniformly distributed values? a) linear search b) jump search c) interpolation search d) binary search

• linear search

• jump search

• interpolation search

• binary search

Which of the following step is taken after finding an element having value greater than the element being searched? a) binary search takes place in the forward direction b) binary search takes place in a backward direction c) linear search takes place in the forward direction d) linear search takes place in the backward direction

• binary search takes place in the forward direction

• binary search takes place in a backward direction

• linear search takes place in the forward direction

• linear search takes place in the backward direction

How can Jump Search be improved? a) Step size should be other than sqrt(n) b) Cannot be improved c) Begin from the kth item, where k is the step size d) Start searching from the end

• Step size should be other than sqrt(n)

• Cannot be improved

• Begin from the kth item, where k is the step size

• Start searching from the end

Interpolation search is a variation of? a) Exponential search b) Linear search c) Binary search d) Jump search

• Exponential search

• Linear search

• Binary search

• Jump search

Which of the following searching algorithm is fastest? a) binary search b) linear search c) jump search d) all are equally fast

• binary search

• linear search

• jump search

• all are equally fast

Which of the following is not an advantage of Fibonacci Search? a) When the element being searched for has a non uniform access storage b) It can be applied efficiently on unsorted arrays c) Can be used for large arrays which do not fit in the CPU cache or in the RAM d) Can be used in magnetic tapes

• When the element being searched for has a non uniform access storage

• It can be applied efficiently on unsorted arrays

• Can be used for large arrays which do not fit in the CPU cache or in the RAM

• Can be used in magnetic tapes

In which of the following case jump search will be preferred over exponential search? a) when the given array is very small in size b) when the given array is very large in size c) jumping backwards takes significantly more time than jumping forward d) jumping forward takes significantly more time than jumping backwards

• when the given array is very small in size

• when the given array is very large in size

• jumping backwards takes significantly more time than jumping forward

• jumping forward takes significantly more time than jumping backwards

Which of the following searching algorithm is used with exponential sort after finding the appropriate range? a) Jump search b) Fibonacci Search c) Linear search d) Binary search

• Jump search

• Fibonacci Search

• Linear search

• Binary search

In which of the cases uniform binary search fails compared to binary search? a) Complexity of code b) Many searches will be performed on several arrays of the same length c) Many searches will be performed on the same array d) A table lookup is generally faster than an addition and a shift

• Complexity of code

• Many searches will be performed on several arrays of the same length

• Many searches will be performed on the same array

• A table lookup is generally faster than an addition and a shift

Which of the following is not an application of binary search? a) To search in unordered list b) Debugging c) Union of intervals d) To find the lower/upper bound in an ordered sequence

• To search in unordered list

• Debugging

• Union of intervals

• To find the lower/upper bound in an ordered sequence