testing - boundary analysis test case on string match algorithm -


in software testing, boundary value analysis intuitive numerical input, when try boundary analysis on string match algorithms (e.g boyer moore), find hard boundary analysis , derive test cases it.

for numerical boudary, e.g. x input , x>=100. boundary value 100 example

boundary: x>=100 on point: x=100 off point: x=101 

but consider string matching, have 2 equivalent classes:

ec1: length(pattern) = length(text), pattern occurs in text.   ec2: length(pattern) = length(text), pattern occurs not in text. 

ec1 should return match(which 0), , ec2 should return -1.but boundary values hard determine cos not numerical boundary, can say:

boundary: pattern occurs in text. on point: pattern occurs in text.  off point: pattern not occur in text 

thanks in advance


Comments

Popular posts from this blog

ubuntu - PHP script to find files of certain extensions in a directory, returns populated array when run in browser, but empty array when run from terminal -

php - How can i create a user dashboard -

javascript - How to detect toggling of the fullscreen-toolbar in jQuery Mobile? -