An online store called Complete Colorguard Equipment sells customized flags for colorguard performances. The store uses a program where the customer inputs the specifics for a flag order. Customers may order poles separately from flags. The program then calculates the total cost of the order. The following input is required:
The length of the pole as an integer: 5 - 9 ft inclusive
Should the pole be weighted? Yes, No
The pattern on the flag: SOLID, STRIPES, CURVES
The preferred fabric: COTTON, NYLON.
The number of flags to be purchased as an integer: 1-99 inclusive
Each nylon flag costs $15 (tax is included in the price), plus $2 per foot over five feet. Each cotton flag costs $20 (tax is included in the price), plus $2 per foot over five feet. A weighted pole adds $5 to the total price. A discount of %10 is applied to orders of 20 flags or more. A shipping cost of $2.00 per flag is applied to the order.
Exercise:
1. Write a list of equivalence classes for the input
data
to this program.
2. Write a set of test cases to exercise all the
equivalence classes. (Include pattern, even though it doesn't affect
the price.)
For each test case indicate which classes it
covers.
A computer program reads the start time for a call based on
a 24-hour clock and the length of the call. The gross cost (before
any discounts or tax) is printed followed by the net cost
(after discounts are deducted and tax is added).
The program will assume only whole number values
are input, that the duration is non-negative
and the start time represents a real clock time. Results are rounded to
the nearest cent.
Exercise: Write a complete set of Black Box test cases (equivalence
classes and boundary value) for testing
of the program which solves the problem above. Create a table like the
one below.
Include a complete description field for the purpose of the each test
case.
Case # | Description | Input Values |
Expected Output |
1 | |||
2 | |||
3 | |||
4 | |||
... |
Problem #3
Read the description of the Parcel Postage problem.Case # | Description | Transaction input |
Expected Output |
1 | |||
2 | |||
3 | |||
4 | |||
... |
Exercise: Write a complete set of Black Box test cases for testing
of the program which solves the problem above. Create a table like the
one below.
Case # | Description | Input Values | Expected Outcomes |
1 | All values equal | 3 3 3 | EQUILATERAL |
2 | |||
3 | |||
4 | |||
... |