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

A. O(m + n)

B. O(m log n)

C. O(n)

D. O(m*n)

A. Rolling Hash

B. Modulo Operation

C. Multiplication

D. Addition

A. It is complex to implement.

B. It requires the text to be sorted.

C. It cannot handle patterns with special characters.

D. It can be slow for large texts.

A. Knuth-Morris-Pratt (KMP)

B. Rabin-Karp

C. Boyer-Moore

D. Naive Search

A. By sorting the text.

B. By using the failure function.

C. By using a sliding window.

D. By sorting the text.

A. To skip segments of the text based on mismatched characters.

B. To preprocess the pattern.

C. To hash the pattern.

D. To sort the pattern.

A. Naive Search

B. Boyer-Moore

C. Knuth-Morris-Pratt (KMP)

D. Rabin-Karp

A. O(m + n)

B. O(m*n)

C. O(mnk)

D. O(n)

A. The array used for storing results.

B. The data structure used in KMP algorithm.

C. The table used to track character shifts.

D. The array used for storing results.

A. It is the fastest for short texts.

B. It does not require preprocessing.

C. It allows for efficient multiple pattern matching.

D. It always performs in linear time.