page 1 out of 1
page 1 out of 1
Question 1
What is the time complexity for string matching having string size m and main string length N using Naïve approach?
Question 2
Which of the following are possible to implement string matching algorithms?
Question 3
What is the pre-processing time for string matching of string size m and main string size ‘n’ using Rabin-Karp?
Question 4
Total running time of algorithm is sum of the pre-processing and matching times
Question 5
What is the running time complexity for Rabin and Krap algorithm?
Where m is the string and n is main string lengths respectively
Question 6
Which is the efficient algorithm for string matching?
Question 7
In Rabin- Karp algorithm, substring is converted to hash value and compared with hash value.
Question 8
What is the matching time for string matching of string size m and main string size ‘n’ using KMP (Knuth-Morris-Pratt)?
Question 9
What is the time complexity of KMP algorithm where m is the substring length and n is the main string length?
Question 10
Which algorithm is used to identify the plagiarism in a sentence?
page 1 out of 1
page 1 out of 1