• Embed Doc
  • Copy Link
  • Readcast
  • Collections
  • 1
    CommentGo Back
Download
 
White Box Testing Tutorial – 4: Estimation of Complexity Measure V(G) : For a Quadratic EquationObjective of the Tutorial:
To draw a Flow Graph, find its Cyclomatic Complexity, V(G) and the independentpaths for the program reading a, b and c as the three coefficients of the quadratic equationaX
2
+ bx + c = 0. It determines the nature of the roots of this equation.
A brief Introduction to Basis Path Testing & measurement of Complexity Measure V(G):
Basis path testing helps a tester to compute logical complexity measure, V(G), of the code. This value of V(G), defines the maximum number of test cases to be designed by identifying basis set of execution pathsto ensure that all statements are executed at least once.
Steps to compute the complexity measure, V(G) are as under Step – 1:
Construct the flow graph from the source code or flow charts.
(Refer Tutorial on “ What is a Flow Graph & Understand its Notations”)Step – 2:
Identify independent paths.
Step – 3:
Calculate Cyclomatic Complexity, V(G).
Step – 4:
Design the test cases. 
Starting point for the Tutorial: Is the construction of the Flow Graph:Step – 1:
Start writing the procedure.proc roots(1) int a, b, c;(2) D = b * b - 4 * a * c;(3) if (D < 0)(4) real = -b/2 * a ; // imaginary rootsD = - D;num = pow ((double) D, (double) 0.5);image = num/(2 * a);(5) else if (D = = 0)(6) root 1 = -b/(2 * a) root 2 = root 1;(7) else if (D > 0)(8) root 1 = (-b + sqrt (d)/2 * a;root 2 = (-b - sgrt(d)/2 * a;(9) end
Step – 2:
Draw the following Flow Graph
 
 
Step – 3:
Calculation of Cyclomatic Complexity V(G) by three methods
Method – 1:
V(G) = e – n + 2 ( Where “e” are edges & “n” are nodes)V(G) = 11– 9 + 2 = 2 + 2 = 4
Method – 2:
V(G) = P + 1 (Where P – No. of predicate nodes with out degree = 2)V(G) = 3 + 1 = 4 (Nodes 3, 5 & 7 are predicate nodes with 2 outgoing edges)
Method – 3:
V(G) = Number of enclosed regions + 1 = 3+1=4( Here R1, R2 & R3 are the enclosed regions and 1 corresponds to one outer region)V(G) = 4 and is same by all the three methods.
Step – 4:
Identification of the basis-set with four pathsPath 1:1 – 2 – 3 – 4 – 9Path 2:1 – 2 – 3 – 5 – 6 – 9Path 3:1 – 2 – 3 – 5 – 7 – 8 – 9Path 4:1 – 2 – 3 – 5 – 7 – 1 – 2 …….
Conclusions from the above tutorial:
The test cases for each of the path are:
of 00

Leave a Comment

You must be to leave a comment.
Submit
Characters: ...
camerahenke19

Great tutorial mate. Here's the video tutorial for those who prefer video over text like me - http://bit.ly/cXQPGN

reply03 / 18 / 2010
You must be to leave a comment.
Submit
Characters: ...