Programming

Question 31

Consider the following program fragment for reversing the digits in a given integer to obtain a new integer. Let n = d₁d₂…d_m.

     int n, rev;
     rev = 0;
     while (n > 0)
     {
        rev = rev*10 + n%10;
        n = n/10;
     }

The loop invariant condition at the end of the ith iteration is:

Question 31 Explanation:

In each iteration the right most digit of n is going to make to the right end of the reverse.

Correct Answer: A

Question 31 Explanation:

In each iteration the right most digit of n is going to make to the right end of the reverse.