Question

The following function in Figure 2 shows a function to calculate a factorial for any input number. int factorial (int n) { /* Calculate a factorial using loop. * A factorial of a number is the product * of the number itself times the factorial of the number minus 1; i.e n! = nx(n-1)x ..1 / int f = 1; if (n < 0) { cout << "Error, Factorial: Negative argument." << \n; } else { for (int i = 2; i <= n; i++) f = f i; } return (f); } Figure 2: Fragment of factorial function code ? Draw the control flow graph of the code. List down the possible test paths in order to achieve 100% test coverage for statement coverage. (test path should be written using this format: SnC-n-..) List down the possible test paths in order to achieve 100% test coverage for decision coverage. (test path should be written using this format: Sn-Cn?..) List down the possible test paths in order to achieve 100% test coverage for branch coverage. (test path should be written using this format: Sn?Cn?..) Calculate Cyclomatic Complexity value for path coverage. You may use any of cyclomatic metric formula.

          The following function in Figure 2 shows a function to calculate a factorial for any input number.
int factorial (int n) {
/* Calculate a factorial using loop.
* A factorial of a number is the product
* of the number itself times the factorial
of the number minus 1; i.e n! = nx(n-1)x ..1 */
int f = 1;
if (n < 0) {
cout << "Error, Factorial: Negative argument."
<< \n;
} else {
for (int i = 2; i <= n; i++)
f = f * i;
}
return (f);
}
Figure 2: Fragment of factorial function code
? Draw the control flow graph of the code.
List down the possible test paths in order to achieve 100% test coverage for
statement coverage. (test path should be written using this format:
SnC-n-..)
List down the possible test paths in order to achieve 100% test coverage for
decision coverage. (test path should be written using this format:
Sn-Cn?..)
List down the possible test paths in order to achieve 100% test coverage for
branch coverage. (test path should be written using this format: Sn?Cn?..)
Calculate Cyclomatic Complexity value for path coverage. You may use any
of cyclomatic metric formula.

The following function in Figure 2 shows a function to calculate a factorial for any input number.
int factorial (int n)
/* Calculate a factorial using loop.
* A factorial of a number is the product
* of the number itself times the factorial
of the number minus 1; i.e n! = nx(n-1)x ..1 */
int f = 1;
if (n < 0)
cout << "Error, Factorial: Negative argument."
<< ;
else
for (int i = 2; i <= n; i++)
f = f * i;

return (f);

Figure 2: Fragment of factorial function code
? Draw the control flow graph of the code.
List down the possible test paths in order to achieve 100% test coverage for
statement coverage. (test path should be written using this format:
SnC-n-..)
List down the possible test paths in order to achieve 100% test coverage for
decision coverage. (test path should be written using this format:
Sn-Cn?..)
List down the possible test paths in order to achieve 100% test coverage for
branch coverage. (test path should be written using this format: Sn?Cn?..)
Calculate Cyclomatic Complexity value for path coverage. You may use any
of cyclomatic metric formula.

Added by Raymond T.

Question

Please give Ace some feedback