CheckPoint: Algorithm Verification
Kelley Stevens
IT/210
February 10, 2012
Dennis Wood

CheckPoint: Algorithm Verification
1. What will be printed if the input is 0? You fail
2. What will be printed if the input is 100? Your grade is 100, You did great
3. What will be printed if the input is 51? Your grade is 51, You did OK
4. What will be printed if the user enters “Wingding”? It would cause an error
5. Is this design robust? No If so, explain why. If not, explain what you can do to make it robust. You would need to add lines to deal with things such as if an invalid integer was input, then have the program display “error” “please enter a new score”
6. How many levels of nesting are there in this design? 4
7. Provide a set of values that will test the normal operation of this program segment. 1 and 99 Defend your choices. 1 is the test for the lowest function and 99 will test the highest function. These numbers will run throughout the program and will test all stages to verify the program is running properly
8. Provide a set of test values that will cause each of the branches to be executed. 10 will test stage 1, 60 will test stage 2, 75 will test stage 3, and 90 will test stage 4
9. Provide a set of test values that test the abnormal operation of this program segment. J, #, -2, and 1000