Question

in Boyer- Moore Algorithm and Knuth-Morris-Pratt Algorithm if a) the string is aabcbcbabcabcabc;

Answer 1

6) a) Bover Moore algorithm String-aabbcbababc attern-abc step1: Inert the text character in the shift table Index: 012 3 45 6 7 89 1011 12 13 1415 Text: a b c b C Pattern: ab C step 2 shift the character pattem Index: 0 1 2 3 45 6 78 9 10 11 12 13 14 15 ext: Pattern b Bad Char: a b c shift:

step 3: No match found at 0,1 comparisons so far Index: Text: Pattern: ab c Bad Char b C 0 1 2 3 45 6 7 8 9 10 11 12 13 14 15 hift: Match at1 comparisons so far Index: 12 3456 781011 12 13 14 15 Text a a b c b Cb ab ca b ca bC attern: Bad Char: b C shift:

Step4 No match has found at 2, 6 comparison Index: 0 2 3 4567891011 12 13 14 15 ext: Pattern: Bad Char bC shift step 5 no match has foundat 3, 9 comparison using the bad character Index: 2 345 678 9 10 11 12 13 1415 ext: Pattern Bad Char ab c hift: Step 6 no match found at 6,10 comparisons

Index: 0 2 3 4 5 67 8 9 10 11 12 13 1415 ext: Pattern: Bad Char: ab C 2 13 ift: Match found at 7 14 comparisons Index: 0 2 3 4 5 67 8 9 10 11 12 13 14 15 C abc a b c ext: Pattern: Bad Char ab shift No match found at 815 comparisons using bad character Index: 2 3 4 5 6 8 910 11 12 13 14 15 ext: Pattern: Bad Char bC shift:

Match foundat 10,10 comparisons Index: Text: 0 2 3 4 5 6 8 910 11 12 13 14 15 attern: Bad Char: a b shift: no match found at 11,20 comparisons using bad character Index: 0 2 3 4 5 6 11 12 13 14 15 ext: Pattern: Bad Char ab C hift

match found at 13,24 comparisons Index: ext: Pattern: Bad Char: a b c shift: 2 1 3 7 8 9 10 0 1 2 3 45 6 11 12 13 14 15

Knuth-Morris-Pratt step 1: b cb cb a b c a a b c Fail Value 0-1 step 2: Failed at position 1 fail(1)-0 so we can jump by (1)-(0)-1 a a b cbcbabcabcabc

Fail IValue 0-1 2 step 3: a a b cbcbabcabcabc a b c Fail Match found! 0-1 2 build comparis search comparison:5