List of questions
Related questions
Question 50 - CTAL discussion
Consider the following perl code;
$x = 100;
If ($account > 100)
{ for ($deposit =
1
;
$
deposit >
3
;
$
deposit ++)
{$x=$x+1;
}i
f ($account <= 100)
{ for ($withdraw =
0; $
withdraw >
2
;
$
withdraw ++)
{
$x=$x-1;
}}
$x=$x+100;
How many test cases at a minimum are needed to test the path coverage?
A.
6
B.
5
C.
4
D.
3
Your answer:
0 comments
Sorted by
Leave a comment first