i. Draw the control flow graph(CFG) for variable 'z'. [7 marks] ii. List the possible test...

Transcribed Image Text:

i. Draw the control flow graph(CFG) for variable 'z'. [7 marks] ii. List the possible test path(s) for variable 'z' using All-uses(AU) strategy. [4 marks] 234567891 10 11 12 13 111111 01234567 14 15 16 void pow (int x, y) { www. float z; int pi if (y < www 0) - p = 0 y; else = y; Z = 1.0; while (p = 0) { Z = Z N Q = N Q p 17 if (y < 0) 18 19 20 21 } www * - x; 1; z = 1.0z; printf(z); Figure 3: Fragment of pow() function. i. Draw the control flow graph(CFG) for variable 'z'. [7 marks] ii. List the possible test path(s) for variable 'z' using All-uses(AU) strategy. [4 marks] 234567891 10 11 12 13 111111 01234567 14 15 16 void pow (int x, y) { www. float z; int pi if (y < www 0) - p = 0 y; else = y; Z = 1.0; while (p = 0) { Z = Z N Q = N Q p 17 if (y < 0) 18 19 20 21 } www * - x; 1; z = 1.0z; printf(z); Figure 3: Fragment of pow() function.