Question 5: Consider the following code fragment. int compute (int m, int n) { int r; if (n>m) { r=m; m=n; n=r; } r=m%n; while (r!0) { m=n; n=r; r=m%n; } return n; } A. Draw the flow graph. B....

Question 5: Consider the following code fragment.<br>int compute (int m, int n)<br>{<br>int r;<br>if (n>m) {<br>r=m;<br>m=n;<br>n=r;<br>}<br>r=m%n;<br>while (r!0)<br>{<br>m=n;<br>n=r;<br>r=m%n;<br>}<br>return n;<br>}<br>A. Draw the flow graph.<br>B. Calculate the cyclomatic complexity.<br>C. Specify which independent paths are needed to test this code?<br>

Extracted text: Question 5: Consider the following code fragment. int compute (int m, int n) { int r; if (n>m) { r=m; m=n; n=r; } r=m%n; while (r!0) { m=n; n=r; r=m%n; } return n; } A. Draw the flow graph. B. Calculate the cyclomatic complexity. C. Specify which independent paths are needed to test this code?

Jun 11, 2022

SOLUTION.PDF

Question 5: Consider the following code fragment. int compute (int m, int n) { int r; if (n>m) { r=m; m=n; n=r; } r=m%n; while (r!0) { m=n; n=r; r=m%n; } return n; } A. Draw the flow graph. B....

Get Answer To This Question

Related Questions & Answers

Submit New Assignment