Question

Consider a program that computes the factorial of a number (n). From the specifications you know that:

- If n < 0, a message "Value out of range" must be issued.
- If 0 =< n < 20, the program returns the exact factorial number
- If 20 =< n =< 200 the factorial number must be approximated and visualized in floating point notation
- If n > 200 a message "Value out of range" must be issued
Which of the following equivalence partitioning is correct?
A. (n < 0), (0 =< n < 20), (n >= 20)
B. (n< 0), (0 =< n < 200), (n > 200)
C. (n < 0), (0 =< n < 20), (20 =< n =< 200), (n > 200)
D. (n =< 0), (n < 20), (n >= 20), (n > 200)

Answer 1

The correct equivalence partitioning for a program computing the factorial of a number based on given specifications is option C: (n < 0), (0 ≤ n < 20), (20 ≤ n ≤ 200), (n > 200).

Step-by-step explanation:

The question relates to the equivalence partitioning of input values for a program that computes the factorial of a number. The specifications given designate different behaviors depending on the input value, known as n.

Equivalence partitioning is a technique where input data is divided into partitions of equivalent data from which test cases can be derived. According to the specifications, the correct partitions are:

• n < 0
• 0 ≤ n < 20
• 20 ≤ n ≤ 200
• n > 200

Thus, the correct option is C. (n < 0), (0 ≤ n < 20), (20 ≤ n ≤ 200), (n > 200).