What is the complexity of the Aho-Corasick algorithm?
a. O(n)
b. O(n^2)
c. O(log n)
d. O(n log(n))
a. O(n)
The complexity of the algorithm is linear in the length of the strings plus the length of the searched text plus the number of output matches.
You might also like to view...
You set ________ to prevent users from changing the content of a document
A) formatting restrictions B) editing restrictions C) user exceptions D) IRM
Chris is an information security professional for a major corporation and, as he is walking into the building, he notices that the door to a secure area has been left ajar. Physical security does not fall under his responsibility, but he takes immediate action by closing the door and informing the physical security team of his action. What principle is Chris demonstrating?
A. Due care B. Due diligence C. Separation of duties D. Informed consent