Consider the following program fragment for reversing the

Home » Programming & Data Structure » Programming and data structure miscellaneous » Question

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

1. n = d₁ d₂ ...d_m–i and rev = d_m d_m-1 ...d_{m-j + 1}
2. n = d_{m – i + 1} ...d_{m – 1} d_m or rev = d_{m - i}...d₂ d₁
3. n ≠ rev
4. n = d₁ d₂ ...d_m or rev = d_m ...d₂ d₁

Correct Option: A

NA