Login / Signup

Question

The Knuth-Morris-Pratt (KM

P algorithm improves upon the Naive approach by avoiding unnecessary re-comparisons. It achieves this by:

A Using a hash function.

B Preprocessing the text to build a suffix tree.

C Preprocessing the pattern to build a "longest proper prefix which is also suffix" (LPS) array.

D Always shifting the pattern by 'M' positions.

E Comparing characters from right to left.

Practice Next

More IT Operating System Questions

Which algorithm is used for constraint satisfaction problems?
A system uses paging with a logical address space of 2^26 bytes and a page size of 4 KB. How many bits are required for the page number in the logical addr...
Which data structure is most commonly used to efficiently implement a priority queue?
What is the value of sum after the following Python code executes? sum = 0 for i in range(5): if i % 2 == 0: sum += i ...
What is a key characteristic of a "full binary tree"?
What is the purpose of the #include directive in C/C++ programming?
When a large number of analog signal is to be converted to digital form, an analog multiplexer is used. The best suites analog to digital converter for thi...
Address is which type of attribute?
What is the primary function of the CICS (Customer Information Control System) in mainframe computing?
Consider the Quick Sort algorithm with the last element as the pivot. For the array [7, 2, 1, 6, 8, 5, 3, 4], what will be the state of the array *after th...

Hey! Ask a query

ask-question