# Quick Search Algorithm Multiple choice Questions and Answers (MCQs)

## Click on any option to know the CORRECT ANSWERS

 Question 1
Which of the following is the fastest algorithm in string matching field?
 A Boyer-Moore's algorithm B String matching algorithm C Quick search algorithm D Linear search algorithm

Question 1 Explanation:
Quick search algorithm is the fastest algorithm in string matching field whereas Linear search algorithm searches for an element in an array of elements.

 Question 2
Which of the following algorithms formed the basis for the Quick search algorithm?
 A Boyer-Moore's algorithm B Parallel string matching algorithm C Binary Search algorithm D Linear Search algorithm

Question 2 Explanation:
Quick search algorithm was originally formed to overcome the drawbacks of Boyer-Moore's algorithm and also for increased speed and efficiency.

 Question 3
What is the time complexity of the Quick search algorithm?
 A O(n) B O(log n) C O(m+n) D O(mn)

Question 3 Explanation:
The time complexity of the Quick search algorithm was found to be O(m+n) and is proved to be faster than Boyer-Moore's algorithm.

 Question 4
What character shift tables does quick search algorithm use?
 A good-character shift tables B bad-character shift tables C next-character shift tables D both good and bad character shift tables

Question 4 Explanation:
Quick search algorithm uses only bad character shift tables and it is one of the reasons for its increased speed than Boyer-Moore's algorithm.

 Question 5
What is the space complexity of quick search algorithm?
 A O(n) B O(log n) C O(m+n) D O(mn)