Algorithm Verification (2)

Algorithm Verification (2) -...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CheckPoint: Algorithm Verification Answer the following questions about the information in Appendix J: 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 (X), You Did Great 3. What will be printed if the input is 51? Your Grade is (X), You Did OK 4. What will be printed if the user enters “Wingding”? How did you do? 5. Is this design robust? If so, explain why. If not, explain what you can do to make it robust. I do not believe it is robust because it does not give a command in the event that a user does not input an integer. Also, it does not define what X is mean to be, for instance Declare X as an Integer 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. Defend your choices.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: -1,0,49,50,51,69,70,71,84,85,86,99,100,101 All values are one below, at the normal levels, and just one above the various thresholds for determining if each segment works properly. 8. Provide a set of test values that will cause each of the branches to be executed. 1,51,71,86 9. Provide a set of test values that test the abnormal operation of this program segment.-1,101, ABC My academic advisor directed me to a text: assetMetaId=56573e54-add7-4520-9a90-1e105e665d4b&assetDataId=04cf218c-f12b-4ec9-8ed5-22c21fd7b058 that has been helping me greatly (I think) to help me better understand pseudocode. So, I would greatly appreciate you feedback as to whether or not I am beginning to grasp this concept....
View Full Document

This note was uploaded on 08/26/2011 for the course IT 210 IT/210 taught by Professor Mathhews during the Spring '11 term at University of Phoenix.

Ask a homework question - tutors are online