CSE 5311 Fall 1999
- (15 points).
What good suffix values and bad character values would be computed using
the Boyer Moore algorithm for the pattern P = ``panama canal pan''?
If a mismatch occurs at position j = 14 in the pattern array, where the
mismatched character in T is ``n'', how far over will the window be moved?
- (5 points).
Given points ordered by strictly increasing y values,
which two points are guaranteed to
be included in a convex hull? Justify your answer.