Which algorithms (in the implementations described in the course) can achieve a worst–case matching time of O(n) (check all that apply)?

a. Boyer-Moore
b. Rabin-Karp
c. Knuth-Morris-Pratt
d. Aho-Corasick


c. Knuth-Morris-Pratt

Computer Science & Information Technology

You might also like to view...

The code in the ____ block of a Property procedure allows an application to assign a value to the Private variable associated with the property.

A. Get B. SetProperty C. Set D. GetProperty

Computer Science & Information Technology

You would like to conduct a survey and ask your web page visitors to indicate the computer operating systems that they use. Each visitor could use more than one computer operating system. Select the form control that is best to use for this purpose

a. check box b. radio button c. text box d. scrolling text box

Computer Science & Information Technology

The most common type of patch panel today uses a special type of connecter called a(n) _______________.

Fill in the blank(s) with the appropriate word(s).

Computer Science & Information Technology

____ storage is increasingly being used for backup purposes.

A. Local B. Smart C. Procedural D. Cloud

Computer Science & Information Technology