Question

Q4 Backward Reasoning 10 Points Consider the following code and apply backward reasoning. You may assume all variables/values are integers. #L1 precondition: ?? y = -1 # L2 precondition: ?? x = -2 if z == 0: # L3 precondition: ?? y = x * y else: # L4 precondition: ?? y = x x = 0 #postcondition: y > 0 Q4.1 2 Points What is the weakest precondition for the entire code (aka, location L1)?

Name: q4 backward reasoning 10 points consider the following code and apply backward reasoning you may assume all variablesvalues are integers l1 precondition y 1 l2 precondition x 2 if z 0 l3 pre 44136
Uploaded: 2022-04-26T10:18:51-08:00
Duration: 1 min 30 s
Channel: Suchitra K
Description: q4 backward reasoning 10 points consider the following code and apply backward reasoning you may assume all variablesvalues are integers l1 precondition y 1 l2 precondition x 2 if z 0 l3 pre 44136

          Q4 Backward Reasoning
10 Points
Consider the following code and apply backward reasoning. You may assume all variables/values
are integers.
#L1 precondition: ??
y = -1
# L2 precondition: ??
x = -2
if z == 0:
# L3 precondition: ??
y = x * y
else:
# L4 precondition: ??
y = x
x = 0
#postcondition: y > 0
Q4.1
2 Points
What is the weakest precondition for the entire code (aka, location L1)?

q4 backward reasoning 10 points consider the following code and apply backward reasoning you may assume all variablesvalues are integers l1 precondition y 1 l2 precondition x 2 if z 0 l3 pre 44136

Added by Allen O.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Instant Answer

Solved by Expert Suchitra K

04/26/2022

Step 1

Let's analyze the code. If $z == 0$, then $y = x * y$. If $z != 0$, then $y = x$. Finally, $x = 0$. Show more…

Show all steps

Thanks for your feedback!

Q4 Backward Reasoning 10 Points Consider the following code and apply backward reasoning. You may assume all variables/values are integers. #L1 precondition: ?? y = -1 # L2 precondition: ?? x = -2 if z == 0: # L3 precondition: ?? y = x * y else: # L4 precondition: ?? y = x x = 0 #postcondition: y > 0 Q4.1 2 Points What is the weakest precondition for the entire code (aka, location L1)?