Question
Asked by:
$10.00 Algorithm verification
- From Computer-Science: Algorithms
- Closed, but you can still post tutorials
- Due on Jun. 12, 2008
- Asked on Jun 11, 2008 at 5:49:52PM
Q:Algorithm Verification
Consider the following selection statement where X is an integer test score between 0 and 100.
input X
if (0 <= X and X < 49)
output "you fail"
else if (50 <= X and X < 70)
output "your grade is" X
output "you did OK"
else if (70 <= X and X < 85)
output "your grade is" X
output "you did well"
else if (85 <= X and X < 100)
output "your grade is" X
output "you did great"
endif
output "how did you do?"
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.
Attachments:
it210_appendix_J Algorithm Verification.doc (41K)
