Consider the following pseudo-code fragment, where m is a non-negative integer that has been initialized:

p=0;

k=0;

while(k < m)

        p = p + 2k;

        k=k+1;

end while

Which of the following is a loop invariant for the while statement?

(Note: a loop variant for a while statement is an assertion that is true each time guard is evaluated during the execution of the while statement).

1
p = 2k - 1 and 0≤k < m
2
p = 2k+1 - 1 and 0≤k < m
3
p = 2k-1 and 0≤k≤m
4
p = 2k+1 - 1 and 0≤k≤m

Sponsored

hivanix.in

Visit

This quiz is brought to you by hivanix.in

🌐 Web App Development

Quick Navigation