Question 11 : The searching phase in quick search algorithm has good practical behaviour.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 12 : If the expected number of valid shifts is small and modulus is larger than the length of pattern what is the matching time of Rabin Karp Algorithm?
1. Theta(m)
2. Big-Oh(n+m)
3. Theta(n-m)
4. Big-Oh(n)
View Answer   Discuss with Members

Question 13 : Rabin Karp Algorithm makes use of elementary number theoretic notions.
1. True
2. False
3.
4.
View Answer   Discuss with Members

Question 14 : What happens when the modulo value(q) is taken large?
1. Complexity increases
2. Spurious hits occur frequently
3. Cost of extra checking is low
4. Matching time increases
View Answer   Discuss with Members

Question 15 : What is the basic formula applied in Rabin Karp Algorithm to get the computation time as Theta(m)?
1. Halving rule
2. Horner's rule
3. Summation lemma
4. Cancellation lemma
View Answer   Discuss with Members

Question 16 : Which of the following is the fastest algorithm in string matching field?
1. Boyer-Moore's algorithm
2. String matching algorithm
3. Quick search algorithm
4. Linear search algorithm
View Answer   Discuss with Members

Question 17 : What is the space complexity of quick search algorithm?
1. O(n)
2. O(log n)
3. O(m+n)
4. O(mn)
View Answer   Discuss with Members

Question 18 : What is a Rabin and Karp Algorithm?
1. String Matching Algorithm
2. Shortest Path Algorithm
3. Minimum spanning tree Algorithm
4. Approximation Algorithm
View Answer   Discuss with Members

Question 19 : Which of the following algorithms formed the basis for the Quick search algorithm?
1. Boyer-Moore's algorithm
2. Parallel string matching algorithm
3. Binary Search algorithm
4. Linear Search algorithm
View Answer   Discuss with Members

Question 20 : What is the pre-processing time of Rabin and Karp Algorithm?
1. Theta(m²)
2. Theta(mlogn)
3. Theta(m)
4. Big-Oh(n)
View Answer   Discuss with Members