Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 13

Black Box Testing

M. DANIYAL MUGHAL
BCSE-8A

What?

Black box testing is theSoftware testing methodswhich is


used to test the software without knowing the internal
structure of code or program..

All testing is done as customers point of view and tester


is only aware of what software is suppose to do but how
these requests are processed by software is not known.

Tester only passes valid as well as invalid inputs &


determines the correct expected outputs.

Code is not checked and logic is not verified.

Types

Equivalence Partitioning

Boundary Value Analysis (BVA)

Cause Effect Graphing

Equivalence Partitioning

Itis a software test design


technique that involves dividing
input values into valid and invalid
partitions and selecting
representative values from each
partition as test data.

Steps
1.

The divided sets are called Equivalence Partitions or


Equivalence Classes.

2.

Then we pick only one value from each partition for


testing.

3.

The hypothesis behind this technique isthat if one


condition/value in a partition passes all others will
also pass.

4.

Likewise, if one condition in a partition fails, all other


conditions in that partition will fail.

Example
Input
A integer N such that:
-99 <= N <= 99

Valid Equivalence Classes

Invalid Equivalence Classes

Example continued..
Input

Valid Equivalence Classes

A integer N such that:


-99 <= N <= 99

[-99, -10]
[-9, -1]
0
[1, 9]
[10, 99]

Invalid Equivalence Classes

Example continued..
Input

Valid Equivalence Classes

Invalid Equivalence Classes

A integer N such that:


-99 <= N <= 99

[-99, -10]
[-9, -1]
0
[1, 9]
[10, 99]

< -99
> 99
Malformed numbers
{12-, 1-2-3, }
Non-numeric strings
{junk, 1E2, $13}
Empty value

Boundary Value Analysis

Itis a software test design


technique that involves
determination of boundaries for
input values and selecting values
that are at the boundaries and just
inside/ outside of the boundaries as
test data.

BVA-Example

Suppose system asks for a number between 100 and 999 inclusive.

The boundaries are 100 and 999.


We therefore test for values:
99

100

101

lower boundary

998

999

upper boundary

1000

BVA-Example Continued..
Input
A number N such that:
-99 <= N <= 99

Boundary Cases

BVA-Example continued..
Input

Boundary Cases

A number N such that:


-99 <= N <= 99

-100, -99, -98


-10, -9
-1, 0, 1
9, 10
98, 99, 100

Thank you

You might also like