What is the time complexity of string matching using a suffix tree?
Select an option to see the answer and solution.
Data Structure · all questionsString Matching
String Matching
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
70
Questions
3/4
Page
Pick an option on a question to see the right answer and solution.
Which algorithm is well-suited for string matching when dealing with long and complex patterns?
Select an option to see the answer and solution.
In the Boyer-Moore algorithm, how is the "good suffix rule" utilized?
Select an option to see the answer and solution.
Which string matching algorithm is known for being efficient with very large alphabets?
Select an option to see the answer and solution.
What is a key characteristic of the Naive string matching algorithm?
Select an option to see the answer and solution.
What is the pre-processing time of Rabin and Karp Algorithm?
Select an option to see the answer and solution.
Given a pattern of length-5 window, find the suitable modulo value.
4 3 2 5 0
Select an option to see the answer and solution.
What is the basic principle in Rabin Karp algorithm?
Select an option to see the answer and solution.
What is the space complexity of quick search algorithm?
Select an option to see the answer and solution.
If n is the length of text(T) and m is the length of the pattern(P) identify the correct matching algorithm.
Options are not available for this question.
Select an option to see the answer and solution.
Rabin Karp Algorithm makes use of elementary number theoretic notions.
Select an option to see the answer and solution.
If n is the length of text(T) and m is the length of the pattern(P) identify the correct pre-processing algorithm. (where q is a suitable modulus to reduce the complexity)
p=0; t0=0;
p=0; t0=0;
Options are not available for this question.
Select an option to see the answer and solution.
What is the worst case running time in searching phase of Boyer-Moore's algorithm?
Select an option to see the answer and solution.
Which of the following is the fastest algorithm in string matching field?
Select an option to see the answer and solution.
What is the worst case running time of Rabin Karp Algorithm?
Select an option to see the answer and solution.
What happens when the modulo value(q) is taken large?
Select an option to see the answer and solution.
Rabin- Karp algorithm can be used for discovering plagiarism in a sentence.
Select an option to see the answer and solution.
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?
Select an option to see the answer and solution.
Which of the following algorithms formed the basis for the Quick search algorithm?
Select an option to see the answer and solution.
Given a pattern of length- 5 window, find the valid match in the given text.
Pattern: 2 1 9 3 6
Modulus: 21
Index: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
Text: 9 2 7 2 1 8 3 0 5 7 1 2 1 2 1 9 3 6 2 3 9 7Select an option to see the answer and solution.