Check Point Algorithm chit 1. CheckPoint: Algorithm Verification · Answer the following questions ab start the information in addendum J: o What bequeath be printed if the stimulus is 0? o What lead be printed if the input is nose candy? o What leave be printed if the input is 51? o What leave be printed if the user enters Wingding? o Is this design robust? If so, exonerate why. If not, apologize what you hatful do to make it robust. o How many levels of nesting are there in this design? o pass on a coterie of nourishs that will screen out the normal function of this political platform segment. Defend your choices. o Provide a set of runnel values that will cause each of the branches to be executed. o Provide a set of test values that test the abnormal operation of this program segment. Consider the following survival of the fittest statement where X is an integer test score amid 0 and 100. input X if (0 <= X and X < 49) make you crumble else if (50 <= X and X < 70) output your come in is X output you did OK else if (70 <= X and X < 85) output your grade is X output you did intumesce else if (85 <= X and X < 100) output your grade is X output you did dandy endif output how did you do?  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?  The program will abnormally terminate becau! se it is expecting an integer value, and a string value will cause the program to crash.    Is this design robust? If so, explain why. If not, explain what you can do to make it robust.  No, there is no thoughtlessness condition for Scores >= 100, or scores < 0. In addition, 49 and 100 are valid scores. The following should, therefore, be added:  if (0 <= X and X <= 49) output you...If you want to get a just essay, order it on our website: OrderCustomPaper.com
If you want to get a full essay, visit our page: write my paper
No comments:
Post a Comment