Software Testing: White Box Testing Black Box Testing Alpha Testing Beta Testing

Software testing
White box testing

Black box testing
Alpha testing
Beta testing
Copy Write Mr.Ravi, KYUEM

What is White Box Testing
• Test cases are based on our knowledge
of how the object works internally – the
algorithms it uses.
• Allows exhaustive testing of all the
algorithm paths (i.e. each line of code
for each condition)
A software testing technique whereby explicit knowledge of the internal
workings of the item being tested are used to select the test data

What happens in
White box testing
public static int binarySearch( int key, int[] sequence ) {
int bottom = 0;
int top = sequence.length - 1;
int mid = 0;
int keyPosition = -1;
while( bottom <= top && keyPosition == -1 ) { A software testing technique

mid = ( top + bottom ) / 2;
if( sequence[ mid ] == key ) {
whereby explicit knowledge of the
keyPosition = mid; internal workings of the item being
} tested are used to select the test
else {
if( sequence[ mid ] < key ) {
data.
bottom = mid + 1;
}
else {
top = mid - 1;
}
}
}
return keyPosition;
}
Identifying the Different
Algorithm Paths
1 int bottom = 0; 1
int mid = 0;
while( bottom <= top && keyPosition == -1 ) {

keyPosition = mid;
}
else {
bottom = mid + 1;
}
else {
top = mid - 1;
}
}
}
return keyPosition;
}
Algorithm Paths
1 int bottom = 0; 1
int mid = 0;
2
while( bottom2<= top && keyPosition == -1 ) {

keyPosition = mid;
}
else {
bottom = mid + 1;
}
else {
top = mid - 1;
}
}
}
return keyPosition;
}
Algorithm Paths
1 int bottom = 0; 1
int mid = 0; F
2
F
while( bottom2<= top && keyPosition == -1 ) {
keyPosition = mid;
}
else {
bottom = mid + 1;
}
else {
top = mid - 1;
}
10
}
}
10 return keyPosition;
}
Algorithm Paths
1 int bottom = 0; 1
int mid = 0; F
2
T
T
F
while( bottom2<= top && keyPosition
3 == -1 ) { 3
keyPosition = mid;
}
else {
bottom = mid + 1;
}
else {
top = mid - 1;
}
10
}
}
}
Algorithm Paths
1 int bottom = 0; 1
int mid = 0; F
2
T
T
F F 3
F 3 == -1 ) {
keyPosition = mid;
}
else {
bottom = mid + 1;
}
else {
top = mid - 1;
}
10
}
}
}
Algorithm Paths
1 int bottom = 0; 1
int mid = 0; F
2
T
T
F F 3
F 3 == -1 ) {
mid = ( top + bottom ) / 2; T T
if( sequence[ 4
mid ] == key ) { 4
keyPosition = mid;
}
else {
bottom = mid + 1;
}
else {
top = mid - 1;
}
10
}
}
}
Algorithm Paths
1 int bottom = 0; 1
int mid = 0; F
2
T
T
F F 3
F 3 == -1 ) {
T 4
if( sequence[ mid ] == key ) { 4
5
keyPosition = mid;
T
}
else {
5
bottom = mid + 1;
}
else {
top = mid - 1;
}
10
}
}
}
Algorithm Paths
1 int bottom = 0; 1
int mid = 0; F
2
T
T
F F 3
F 3 == -1 ) {
T 4
F
5 = F
keyPosition mid;
T
}
else {
6 5
if( sequence[6mid ] < key ) {
bottom = mid + 1;
}
else {
top = mid - 1;
}
10
}
}
}
Algorithm Paths
1 int bottom = 0; 1
int mid = 0; F
2
T
T
F F 3
F 3 == -1 ) {
T 4
F
5 = F
keyPosition mid;
T
}
else {
6 5
if( sequence[6mid ] < key ) {
bottom = mid + 1;
}
else {
top = mid - 1;
9
}
10
}
9
}
}
Algorithm Paths
1 int bottom = 0; 1
int mid = 0; F
2
T
T
F F 3
F 3 == -1 ) {
T 4
F
5 = F
keyPosition mid;
T
}
else {
6 5
T 6mid ] < key ) {
if( sequence[ T
bottom7= mid + 1;
7
}
else {
top = mid - 1;
9
}
10
}
9
}
}
Algorithm Paths
1 int bottom = 0; 1
int mid = 0; F
2
T
T
F F 3
F 3 == -1 ) {
T 4
F
5 = F
keyPosition mid;
T
}
else {
6 5
F
T 6mid ] < key ) {
if( sequence[ T
F 1;
bottom7= mid +
8 7
}
else {
8 - 1;
top = mid
9
}
10
}
9
}
}
Algorithm Paths
1 int bottom = 0; 1
int mid = 0; F
2
T
T
F F 3
F 3 == -1 ) {
T 4
F
5 = F
keyPosition mid;
T
}
else {
6 5
F
T 6mid ] < key ) {
if( sequence[ T
F 1;
bottom7= mid +
8 7
}
else {
8 - 1;
top = mid
9
}
10
}
9
}
}
Algorithm Paths
1 int bottom = 0; 1
int mid = 0; F
2
T
T
F F 3
F 3 == -1 ) {
T 4
F
5 = F
keyPosition mid;
T
}
else {
6 5
F
T 6mid ] < key ) {
if( sequence[ T
F 1;
bottom7= mid +
8 7
}
else {
8 - 1;
top = mid
9
}
10
}
9
}
}
Algorithm Paths
1 int bottom = 0; 1
int mid = 0; F
2
T
T
F F 3
F 3 == -1 ) {
T 4
F
5 = F
keyPosition mid;
T
}
else {
6 5
F
T 6mid ] < key ) {
if( sequence[ T
F 1;
bottom7= mid +
8 7
}
else {
8 - 1;
top = mid
9
}
10
}
9
}
}
This is What I Got after the tracing the
algorithm
START
hasWings
F T
Legs == 8 Legs == 6
T
F
T F
“Fly”
Legs > 10
“Spider”
Legs == 4 T
T “Grass
Hopper”
F
Legs < 200
F F
T
END
“Millipede”

What happens in
Black box testing
A software testing technique whereby the internal workings of the item
being tested are not known by the tester. For example, in a black box test
on a software design the tester only knows the inputs and what the
expected outcomes should be and not how the program arrives at those
outputs. The tester does not ever examine the programming code and
does not need any further knowledge of the program other than its
specifications

Input What happens in
Black box testing
Program xys;
Var x,y: integer;
Begin
writeln(‘enter a number’);
Read(x);
For I := 1 to 10 do
begin
y:= I*I;
x := x + y;
end;
Writeln(‘the output is’,x);
End.
}
Output
The tester don’t know anything about the

algorithm used In the program but can only
see the output based on his test data.
Advantages in
Black box testing
The advantages of this type of testing include:
•The test is unbiased because the designer and the tester are
independent of each other.
•The tester does not need knowledge of any specific programming
languages.

αlpha and βeta testing
Any software testing will involve alpha and beta testing. However, the
first stage, called alpha testing, is often performed only by users within
the organization developing the software. The second stage, called beta
testing , generally involves a limited number of external users.

Software Testing: White Box Testing Black Box Testing Alpha Testing Beta Testing

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Software Testing: White Box Testing Black Box Testing Alpha Testing Beta Testing

Uploaded by

Copyright:

Available Formats

Software testing

White box testing

Copy Write Mr.Ravi, KYUEM

Copy Write Mr.Ravi, KYUEM

while( bottom <= top && keyPosition == -1 ) { A software testing technique

while( bottom <= top && keyPosition == -1 ) {

while( bottom2<= top && keyPosition == -1 ) {

Copy Write Mr.Ravi, KYUEM

Copy Write Mr.Ravi, KYUEM

The tester don’t know anything about the

Copy Write Mr.Ravi, KYUEM

Copy Write Mr.Ravi, KYUEM

You might also like