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

Multiple choice

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 &lt; 0) {
  rev = rev * 10 + n % 10;
  n = n / 10;
}

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

Reveal answer Fill a bubble to check yourself

Accepted Answer

n = d₁d₂......d_m−i and rev = d_m d_m−1......d_m−i+1

Consider the following program fragment for reversing the digits in a given integer to obtain a new integer. Let n = d1 d2 ………… dm int n, rev; rev = 0; while (n &lt; 0) { rev = rev * 10 + n % 10; n = n / 10; } The loop invariant condition at the end of the ith iteration is