b) d) Identify the weakest pre-condition for the following decision that can guarantee the post- condition to be true. Assertion given in bold. ( ? ) integer m, n if (m > n) else = y 8 y + 1; y 2 * y; y = y + 18; = ★ { y ≥ 18 } Using the loop invariant given in b), identify the strongest post-condition if the pre-condition is given as { y 2 1 A x ≥ 2).

Operations Research : Applications and Algorithms
4th Edition
ISBN:9780534380588
Author:Wayne L. Winston
Publisher:Wayne L. Winston
Chapter16: Probabilistic Inventory Models
Section16.3: The News Vendor Problem: Discrete Demand
Problem 9P
icon
Related questions
Question

descrete math / descrete structure question.

Please answer both subparts

b)
d)
Identify the weakest pre-condition for the following decision that can guarantee the post-
condition to be true. Assertion given in bold.
( ? )
integer m, n
if (m > n)
y
= 8 ★
y 2 * y;
y = y + 18;
else
=
{ y ≥ 18 }
y +1;
Using the loop invariant given in b), identify the strongest post-condition if the pre-condition
is given as { y ≥ 1 A x ≥ 2}.
Transcribed Image Text:b) d) Identify the weakest pre-condition for the following decision that can guarantee the post- condition to be true. Assertion given in bold. ( ? ) integer m, n if (m > n) y = 8 ★ y 2 * y; y = y + 18; else = { y ≥ 18 } y +1; Using the loop invariant given in b), identify the strongest post-condition if the pre-condition is given as { y ≥ 1 A x ≥ 2}.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Bare Bones Programming Language
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Operations Research : Applications and Algorithms
Operations Research : Applications and Algorithms
Computer Science
ISBN:
9780534380588
Author:
Wayne L. Winston
Publisher:
Brooks Cole