boundary value analysis

[saurabh garg]

Hi bagavathi ! Boundary value analysis is testing the boundary condiitions.
Ex : If you have to test the functionality of A prime number prog. working on numbers between 1 to 1000.
Then your test conditions will be :
BVA :
0
1
2
999
1000
1001
U have to check the behaviour of the prog. with the numbers excatly at the boundary, imm. outside the boundary, imm. inside the boundary.


Equivalance partition :
It has got three parts :

(1) Input partitions : The set of inputs can be partitioned into similar type of data to avoid exhaustive testing.
For example: consider a program
which accepts any value between
-10000 and +10000.
Then equivalence partition would be;
Less than zero,
Zero &
Greater than zero
(2) Output partitions : Even the output values can be partitioned just like inputs.
For example: A university declares a result of its student as Fail if the score is 0-35, 2nd class for 35-60, 1st class for 60-75 and distinction for 75 and above. Then o/p partition would be;
0-35 Fail
35-60 second class
60-75 first class
75 and above distinction
(3) Other partitions : It is used when we know enough about application and is an optional on. This is more technical and difficult one.

Regards,
Saurabh Garg