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 = 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

Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :

Share your thoughts in the comments

GeeksforGeeks

Trending in News