Q52
If n is the length of text(T) and m is the length of the pattern(P) identify the correct pre-processing algorithm. (where q is a suitable modulus to reduce the complexity) p=0; t0=0;
Options are not available for this question.
Answer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board