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

A. Hash Table

B. Suffix Tree

C. Failure Function

D. Partial Match Table

A. Rolling Hash

B. Partial Match Table

C. Failure Function

D. Boyer-Moore Heuristic

A. When the pattern is very short.

B. When the text is randomly structured.

C. When the text contains many repetitions.

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

A. Rabin-Karp

B. Knuth-Morris-Pratt (KMP)

C. Boyer-Moore

D. Naive Search

A. Lower space complexity compared to others.

B. Efficient for multiple pattern matching using hashing.

C. Better for single pattern matching.

D. Lower space complexity compared to others.

A. To find all possible matches.

B. To sort the text.

C. To create a partial match table.

D. To compute hash values for patterns.

A. Rabin-Karp

B. Knuth-Morris-Pratt (KMP)

C. Naive Search

D. Boyer-Moore

A. By using a rolling hash.

B. By using a secondary hash function.

C. By rehashing the entire pattern.

D. By using a separate data structure.

A. To preprocess the text.

B. To sort characters of the pattern.

C. To check for hash collisions.

D. To skip portions of the text that cannot match.

A. O(m*n)

B. O(m log n)

C. O(m + n)

D. O(n)