|
| Topics this page: Related Topics:
|
|
|
McCabe's cyclomatic complexity is the number of independent paths through a program, calculated using the formula L - N + 2P where:
|
|
|
| A# | B# | Data Value | Test Description | Expected Response |
|---|---|---|---|---|
| 8. | 1. | 5 | Minimum allowable | Pass: Should accept |
| 7. | 2. | 6 | One greater than minimum | Pass: Should accept |
| 6. | 3. | 120 | Maximum allowable | Pass: Should accept |
| 5. | 4. | 119 | One less than maximum. | Pass: Should accept |
| 4. | 5. | 121 | One more than maximum. | Fail: Server check issues error message. |
| 3. | 6. | 0 | "Newborn" | Fail: Client-side Error: Below minimum age. |
| 2. | 7. | -1 | Negative Value | Fail: Keypress prevents entry. Server check issues error message "Not allowed" |
| 1. | 8. | blank | Blank | Fail: Server check issues error message "Not allowed" |
The two test item numbers are for two different passes of testing:
The "A" sequence begins with invalid values and ends with valid values (the normal user sequence).
The "B" sequence begins with valid values and ends with invalid values.
| Your first name: Your family name: Your location (city, country): Your Email address: |
Top of Page Thank you! | |||