(Solved) : 6 18 Marks Consider Sequence 10 11 Defined 10 0 01 1 1 14 2 2 Consider Following Algorith Q44113738 . . .
6. 18 marks Consider the sequence 10, 11, … defined by 10 = 0,01 = 1, and I = -1 +14-2 for all i > 2. Consider the following algorithm that attempts to compute the value In, given an n > 0. Algorithm 6 1: //pre: (n EZ A n > 0) 2: if n == 0 then 3:50 4: else 5: a+ 0 6: 5+ 1 in1 //LoopInv: while i<n do of a +b ab 12: bec iti+1 14: end while 15: end if 16: //post: b == In 13: Prove that Algorithm 6 satisfies the Partial Correctness property. You will need to provide and prove) your own loop invariant LoopInv for line 8. Show transcribed image text 6. 18 marks Consider the sequence 10, 11, … defined by 10 = 0,01 = 1, and I = -1 +14-2 for all i > 2. Consider the following algorithm that attempts to compute the value In, given an n > 0. Algorithm 6 1: //pre: (n EZ A n > 0) 2: if n == 0 then 3:50 4: else 5: a+ 0 6: 5+ 1 in1 //LoopInv: while i
Expert Answer
Answer to 6. 18 marks Consider the sequence 10, 11, … defined by 10 = 0,01 = 1, and I = -1 +14-2 for all i > 2. Consider the fol…
OR