DAA_UNIT_4

Which of the following algorithms is used for exact string matching?

• Kruskal's Algorithm

• KMP Algorithm

• Floyd-Warshall Algorithm

• Prim's Algorithm

What is the time complexity of the Knuth-Morris-Pratt (KMP) algorithm?

• O(n^2)

• O(n)

• O(m + n)

• O(log n)

In the Rabin-Karp algorithm, the hash function is used to:

• Count characters

• Find a substring

• Compare patterns

• Calculate hash values of substrings

Which algorithm is most efficient for long patterns and large alphabets?

• Naive String Matching

• Boyer-Moore Algorithm

• Rabin-Karp Algorithm

• Dynamic Programming

What is the primary limitation of the Naive String Matching algorithm?

• High space complexity

• High time complexity for large texts

• Limited pattern matching capability

• Inefficient for exact matching

Text justification is primarily concerned with:

• Text compression

• Aligning text evenly across a line

• Sorting text lexicographically

• Encrypting text

In fully justified text, what is minimized between words?

• Character gaps

• Line breaks

• Space gaps

• Font size

Which algorithm can be used for optimal text justification?

• Dynamic Programming

• Greedy Algorithm

• Divide and Conquer

• Kruskal's Algorithm

Which of the following is a challenge in text justification?

• Determining text encoding

• Minimizing uneven spaces

• Finding unique words

• Identifying keywords

Text justification is commonly applied in:

• Machine learning

• Document formatting

• Image processing

• Sorting algorithms