UGC-NET | UGC NET CS 2018 Dec – II | Question 31
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).
(A) p = 2k − 1 and 0≤k<m
(B) p = 2k+1 − 1 and 0≤k<m
(C) p = 2k − 1 and 0≤k≤m
(D) p = 2k+1 − 1 and 0≤k≤m
Quiz of this Question