Q41

MCQ2 marks, −0.5

Consider the following C program main() { int x, y, m, n; scanf("%d %d", &x, &y); /* Assume x>0 and y>0*/ m = x; n = y; while(m != n) { if (m > n) m = m-n; else n = n-m; } printf("%d", n); } The program computes

(A)

$x+y$ using repeated subtraction

(B)

$x \mod y$ using repeated subtraction

(C)

the greatest common divisor of $x$ and $y$

(D)

the least common multiple of $x$ and $y$

Loading…