Question 1 : What character shift tables does Boyer-Moore's search algorithm use?
1. good-character shift tables
2. bad-character shift tables
3. next-character shift tables
4. both good and bad character shift tables
View Answer   Discuss with Members

Question 2 : Rabin- Karp algorithm can be used for discovering plagiarism in a sentence.
1. True
2. False
3.
4.
View Answer   Discuss with Members

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

Question 4 : Given input string = “ABCDABCATRYCARCABCSRT” and pattern string = “CAT”. Find the first index of the pattern match using quick search algorithm.
1. 2
2. 6
3. 11
4. 14
View Answer   Discuss with Members

Question 5 : Who created the Rabin Karp Algorithm?
1. Joseph Rabin and Michael Karp
2. Michael Rabin and Joseph Karp
3. Richard Karp and Michael Rabin
4. Michael Karp and Richard Rabin
View Answer   Discuss with Members

Question 6 : What character shift tables does quick search algorithm use?
1. good-character shift tables
2. bad-character shift tables
3. next-character shift tables
4. both good and bad character shift tables
View Answer   Discuss with Members

Question 7 : What is the worst case running time of Rabin Karp Algorithm?
1. Theta(n)
2. Theta(n-m)
3. Theta((n-m+1)m)
4. Theta(nlogm)
View Answer   Discuss with Members

Question 8 : What is the running time of Boyer-Moore's algorithm?
1. O(n)
2. O(log n)
3. O(m+n)
4. O(mn)
View Answer   Discuss with Members

Question 9 : Quick search algorithm starts searching from the right most character to the left.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 10 : What is the basic principle in Rabin Karp algorithm?
1. Hashing
2. Sorting
3. Augmenting
4. Dynamic Programming
View Answer   Discuss with Members