How many spurious hits does the Rabin-Karp matcher encounter in the text T when looking for the pattern P

K

kan

New member
Joined
May 28, 2020
Messages
14
Given a text T which is a string of hexadecimal digits as follows: T=“31ABC926DEF897A”. Given the pattern P=“BC”. Working modulo q=17 how many spurious hits does the Rabin-Karp matcher encounter in the text T when looking for the pattern P?
 
kan said:
Given a text T which is a string of hexadecimal digits as follows: T=“31ABC926DEF897A”. Given the pattern P=“BC”. Working modulo q=17 how many spurious hits does the Rabin-Karp matcher encounter in the text T when looking for the pattern P?
Click to expand...
Please show us what you have tried and exactly where you are stuck.

Please follow the rules of posting in this forum, as enunciated at:


Please share your work/thoughts about this problem.
 
You must log in or register to reply here.
Top