Computer Science Homework Help

Axioms might look like x < 7 or y = z + 5 and state something that must be true either before the algorithm begins (P) or after the algorithm halts or is terminated (Q)

For the sorting problem on page 5 answer the following questions and submit them for grading in Assignment 1 on Bb:

Question 2

• (a)What are the precondition axiom(s)? (5 points)
• (b)What are the postcondition axiom(s)? (5 points)
• (c)Could you create a totally correct algorithm for the sorting problem? (5 points)
• (d)If you answered No to (c) why can’t a totally correct algorithm be created? If you answered Yes to (c) why does the algorithm satisfy the definition for total correctness? (15 points)