M

Mr. Dubey • 100.69K Points
Coach

Q. What is the time complexity of Z algorithm for pattern searching (m = length of text, n = length of pattern)?

  • (A) o(n + m)
  • (B) o(m)
  • (C) o(n)
  • (D) o(m * n)
Share
Explanation by: Mr. Dubey
z algorithm is an efficient pattern searching algorithm as it searches the pattern in linear time. it has a time complexity of o(m + n) where m is the length of text and n is the length of the pattern.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. Which of the following is an open source software?

Q. A set of programs that handle a firm's database responsibilities is called

Q. The One to One model allows

Q. Which of the following is golden rule for interface design?

Q. Classes are useful because they

Q. Which of the following is used to retrieve pre-enrolment data?

Q. The page length shouldn’t be too long because

Q. Pushing an element into stack already having five elements and stack size of 5, then stack becomes

Q. Mahout provides libraries for common and primitive Java collections.

Q. Let FHAM be the problem of finding a Hamiltonian cycle in a graph G and DHAM be the problem of determining if a Hamiltonial cycle exists in a graph. W

Question analytics