Explore BrainMass
Share

# Algorithm Verification

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

Answer the following questions about the information in Appendix J:
o What will be printed if the input is 0?
o What will be printed if the input is 100?
o What will be printed if the input is 51?
o What will be printed if the user enters "Wingding"?
o Is this design robust? If so, explain why. If not, explain what you can do to make it
robust.
o How many levels of nesting are there in this design?
o Give a set of values that will test the normal operation of this program segment.
Defend your choices.
o Give a set of test values that will cause each of the branches to be executed.
o Give a set of test values that test the abnormal operation of this program segment.

© BrainMass Inc. brainmass.com December 20, 2018, 12:38 am ad1c9bdddf
https://brainmass.com/computer-science/algorithms/algorithm-verification-159678

#### Solution Preview

Hi there!

What will be printed if the input is 0?

"you fail"
"how did you do?"

What will be printed if the input is 100?

"how did you do?"

What will be printed if the input is 51?

"your grade is 51"
"you did OK"
"how did you do?"

What will be printed if the user enters wingding?

"how did you do?"

Is this design robust? If so, explain why. If not explain ...

\$2.19