Q. Consider the program given below
void main()
{
int i,j,k;
readln (i,j,k);
if( (i < j) || ( i > k) )
{
writeln("then part");
if (j < k)
writeln ("j less then k");
else writeln ( " j not less then k");
}
else writeln( "else Part"); }
(i) Draw the flow graph. (4)
(ii) Determine the cyclomatic complexity. (4)
(iii) Arrive at all the independent paths. (8)
Ans:
void main()
{
int i,j,k;
readln (i,j,k);
if( (i < j) || ( i > k) )
{
writeln("then part");
if (j < k)
writeln ("j less then k");
else writeln ( " j not less then k");
}
else writeln( "else Part");
}
(ii) Cyclomatic complexity = E - N + 2 = 12 - 10 + 2 = 4
(iii) The four independent paths are
Path1 : 1 2 3 9 10
Path2 : 1 2 4 5 7 8 10
Path3 : 1 2 4 5 6 8 10
Path4 : 1 2 3 4 5 7 8 10