White box

1. White Box Testing

2. Software Testing
Consider a program for the classification of a triangle. Its input is a
triple of positive integers (say a,b,c) from the interval [1,100]. The output may be
[Scalene, Isosceles, Equilateral, Not a triangle].
Draw the flow graph & DD Path graph. Also find the independent paths from the DD
Path graph.

3. Software Testing

4. Software Testing
Code of triangle classification problem

5. Software Testing
Solution :
Flow graph of
triangle problem is:
Program flow graph

6. Software Testing
The mapping table for DD path graph is:
Remarks
Flow graph
nodes
DD Path graph
corresponding
node
1 TO 9 Sequential nodes
Decision node
10
11
12, 13
14
15, 16, 17
18
19
Decision node
Sequential nodes
Two edges are joined here
Sequential nodes
Decision nodes plus joining of two edges
Decision node
Sequential nodes
Decision node
Sequential nodes
20, 21
22
23, 24
25, 26, 27
A
B
C
D
E
F
G
H
I
J
K
L Sequential nodes
Cont….

7. Software Testing
Remarks
Flow graph DD Path graph
nodes corresponding
node
28 M Three edges are combined here
29 N Decision node
30, 31 O Sequential nodes
32, 33, 34 P Sequential nodes
35 Q Three edges are combined here
36, 37 R Sequential nodes with exit node
DD Path graph

8. Software Testing
DD Path graph is given below:
Independent paths are:
(i) ABFGNPQR
(ii) ABFGNOQR
(iii) ABCEGNPQR
(iv) ABCDEGNOQR
(v) ABFGHIMQR
(vi) ABFGHJKMQR
(vii)ABFGHJLMQR
DD Path graph

9. Software Testing
Consider the classification of triangle problem. Find
the cyclomatic complexity.

10. Software Testing
Solution
Number of edges (e) = 23
Number of nodes (n) =18
(i) V(G) = e - n + 2P = 23 - 18 + 2 = 7
(ii) V(G) = π + 1 = 6 + 1 = 7
(iii) V(G) = Number of regions = 7
The cyclomatic complexity is 7. Hence, there are seven independent paths