So in this lecture we are going to continue with boundary value analysis.
But our focus will be whether knowledge is applicable.
What are the limitations and difficulties of this matter how we can attain the coverage and then what
other type of defects which we can find using a boundary value analysis.
So first we will focus on the applicability where knowledge is applicable.
Boundary value analysis is appropriate then ordered equivalence partitions exist and ordering is required
because of the concept of being on and over the boundary so here.
The first thing is you should have an equivalent partition that should be clearly defined where an all
is the boundary and then the order is also very much required here.
For an example if you have this data and you will provide the equivalent partition for this then at
each boundary.
So this will be your one boundary.
This is the next boundary and in all of these boundaries you can apply this technique and you also need
to know the order of it whether it is increasing order or it is in decreasing order.
So that is also very much required here.
The next question comes is whether or not it is applicable.
So as equivalence partitioning is applicable at all testing level boundary value analysis is also applicable
at all levels unit level integration level system level as well as the acceptance level in any of these
level you can apply boundary value analysis apart from that to be more specific.
So if you have a numeric attribute or non numeric variables like for the length then also you can apply
the boundary value analysis next one is for loops because loop will be running with some values like
5 10 the loops shall execute then PI will become your boundary so including those in the use cases.
As I said 5 is your boundary here.
So loops and all you can apply then stored data structure so that while storing how much is the memory
all those things you have to take it for that next one is the physical objects.
For example memory here so they may say that this many kilobytes of memory should be available.
Then you can add plus and minus of some tolerance will be there.
So there you can apply and the last one is timing related requirement.
Sometimes they will attend.
The features should work between this time two other time so that will become your boundary and then
you have to check between these timings in their timing related requirement.
Also you can use boundary value analysis.
So this is all about the applicability.
So you just have to keep these things in mind.
So if any of this world comes so that you can relate it to boundary value analysis the next thing is
with respect to limitations and difficulties so the limitations will be same as that of equivalence
partition or whatever difficulty you're facing that you will face the same.
Let's see them in more specifically if the assumption is incorrect and the value in the partition are
not handled in exactly the same way this technique may miss the fact.
So this is same as we studied for the equivalence partition the new team here is test and a list must
be aware of the improvements in the valid and invalid value to be able to accurately that reminder value
to be tested.
What does this mean.
Here it is.
We have already seen here in this example the partition was from 1 to 10 but improvement was what zero
point five.
Not for one.
So that is the reason why in deciding the boundaries we have subtracted.
Point five an added point five.
So this inhuman factor is very much important.
Then we are going with boundary value analysis so if this is missed then all your values will be wrong
and all test cases will be wrong the last one is only ordered partitions can be used for boundary value
analysis.
But this is not limited to the range of valid input so if it is ordered properly the partitions are
clearly defined.
Then only you can apply boundary value analysis otherwise you cannot apply and it is also not only therefore
the valued input as well as for the invalid input we can apply.
So this is with respect to the limitations and difficulties moving to the next point.
That is the coverage same as partitioning like equivalence partitioning the coverage is the domain by
taking the number of boundary conditions that are tested and dividing that by the number of identified
boundary conditions.
So to make it more clear I have decided like this.
I have given you a formula here.
Suppose this is your data then you will apply your boundary value here on here.
For an example if you are applying it to the boundary value analysis then you will have to elucidate
and to elucidate crudely for values.
And if you take only one value.
So here what they're saying is no boundary conditions that are tested.
If you're tested only 1 then one will come in.
But how many values are there to live for values are the total identified values will be here in the
denominator multiplied by hundred.
Then you do this you will get 25 percent it's because out of 4 you have tested only one value so that
is how you have to find the coverage and the last point over here is with respect to the types of defect
so it finds that displacement or omissions of boundary if some boundary is not covered that can be find
it out by using monetary value analysis if any extra money are given then that also can be found you
don't errors with less than or greater than logic.
So if you have these type of logics in your code that can be tested using boundary value analysis it
can also be used to find non-functional defects.
For example tolerance of lower limit.
So sometimes you see that the system should start working within any millisecond plus and minus of one
millisecond.
So then your boundary will be 9 and 11.
So there is that tolerance there talking here.
So with this I'm ending this lecture and I will see with the next one.
Until then happy Justine.