Question: Look at the following code, what is the smallest number of tests required to path test this method? public int factorialinti If inco) returni-1)#1 indicates
Look at the following code, what is the smallest number of tests required to path test this method? public int factorialinti If inco) returni-1)#1 indicates an error if (n) return(1); factorial of 0 - 1 Int answer 0 for (int idx-Oldxencidx + + answer answer id 1 return answer): 1 4 2 1 s
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
