Boundary Value Testing

Boundary Value Testing

My task is to come up with the boundary value test cases for this project.

Things to do:

1. Understand boundary value testing
2. Decide on which tests would be more suitable to carry out for this particular program.
3. Come up with different test cases.
4. Make a first draft.
5. Evaluate it.
6. Make a final draft.

Boundary value analysis testing technique is used to identify error at the boundaries of input domain.
Robustness Testing is just an extension to the boundary value analysis with 2 extra test cases added to the BVA test. They include testing for a value just below the min and for a value just above max.

I decided to do the boundary value analysis and robustness test cases as there would be quite a number of test cases I can run.

After discussing with my team members I decided to omit the worst case scenario test as we thought that there wont be many test cases on it. The only test cases we could come up was that the values put in cant be negative or zero and cant be higher than the longest ladder of the world which has 120.

Test cases for BVA

I decided to do a BVA on STEPS(an int user input - the no of steps) and Locations(multiple user inputs )

BVA on STEPS 

• The minimum amount of steps a user can input is 2 as in the schematics of the program it is mentioned the safety officer is only interested in the gaps between the steps and not the height of the first step from the ground. 
• The value above min therefore would be 3.
• I searched for the longest ladder ever made to help me get an idea of the realistic max value allowed. The longest ladder ever made according to some sources in the internet had 110 steps. I decided to have the max value as 120.
• Therefore the nominal value will  be 60.
• The value just below max is 119
• The max value is 120

BVA on Locations

• As the first location input doesn't matter, i thought it would logically make sense to do it on the subsequent input values.
•  The min value of the second input should be 1 value greater than the first one.
• the above min and nominal value would depend on the subsequent input.
• The value right below the max would be 199.
• the max value would be 1 value less than the subsequent input.
• the above max value would be the same input as the next number. ?

BVA combined with robustness testing