software engineering

Suppose that all the paths through the CFG shown in Figure 1 are feasible. Calculate the minimum number of test cases for exercising all the paths through the CFG for the following five cases a) b) c) d) e) Do not exercise the loop Exercise the loop one time Exercise the loop 2 times. Exercise the loop 3 times. Exercise the loop n times. The answer for e) should be in terms of n. (30 marks) 12 5 13 6 8 9 10