Exercise 2. [30 points] Consider the following code (assume n > 1). i=0 x=1 While i...

 

Transcribed Image Text:

Exercise 2. [30 points] Consider the following code (assume n > 1). i=0 x=1 While i<n do x=x+x i=i+1 (a) Identify the loop invariant. For full credit, it must be a non-trivial invariant which gives meaningful information about the variables i and .x. Show your reasoning. (b) Prove that the loop invariant is correct using the sequencing rule. (c) Apply the while loop inference rule and state the program's output. Exercise 2. [30 points] Consider the following code (assume n > 1). i=0 x=1 While i<n do x=x+x i=i+1 (a) Identify the loop invariant. For full credit, it must be a non-trivial invariant which gives meaningful information about the variables i and .x. Show your reasoning. (b) Prove that the loop invariant is correct using the sequencing rule. (c) Apply the while loop inference rule and state the program's output.

Answer rating: 100% (QA)

Loop variant x i OsiN Variant fxh N1 i after mul... View the full answer