String Matching MCQ question and answer with solution | Data Structure MCQs

A. Naive Search

B. Rabin-Karp

C. Boyer-Moore

D. Knuth-Morris-Pratt (KMP)

A. O(m + n)

B. O(n)

C. O(m/n)

D. O(m log n)

A. Boyer-Moore

B. Rabin-Karp

C. Naive Search

D. Boyer-Moore

A. When using a large alphabet.

B. When there are many potential matches.

C. When both the pattern and text are very short.

D. When the pattern is long and the text is large.

A. O(m + n)

B. O(m*n)

C. O(m + n*log n)

D. O(m*n)

A. It skips sections of the text that cannot match.

B. It requires less preprocessing time.

C. It uses less memory.

D. It can handle multiple patterns efficiently.

A. Naive Search

B. Rabin-Karp

C. Knuth-Morris-Pratt (KMP)

D. Boyer-Moore

A. O(n)

B. O(m + n)

C. O(m)

D. O(m*n)

A. Boyer-Moore

B. Rabin-Karp

C. Naive Search

D. Boyer-Moore

A. O(m*n)

B. O(m)

C. O(m + n)

D. O(n)