Consider the following pseudo-code fragment, where m is a non-negative integer that has been initialized.Which of the following is a loop invariant for the while statement?(Note: a loop invariant for a while statement is an assertion that is true each time the guard is evaluated during the execution of the while statement).

Question

TuteeHUB · Accepted Answer

p = 2^(k+1) − 1 and 0≤k≤m

TuteeHUB · Answer

p = 2^k − 1 and 0≤k

TuteeHUB · Answer

p = 2^(k+1) − 1 and 0≤k

TuteeHUB · Answer

p = 2^k − 1 and 0≤k≤m

1.	Consider the following pseudo-code fragment, where m is a non-negative integer that has been initialized.Which of the following is a loop invariant for the while statement?(Note: a loop invariant for a while statement is an assertion that is true each time the guard is evaluated during the execution of the while statement).
A.	p = 2^k − 1 and 0≤k<m
B.	p = 2^(k+1) − 1 and 0≤k<m
C.	p = 2^k − 1 and 0≤k≤m
D.	p = 2^(k+1) − 1 and 0≤k≤m
Answer» D. p = 2^(k+1) − 1 and 0≤k≤m

Discussion

No Comment Found

Related MCQs

Reply to Comment