Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE-CS-2004 | Question 41

  • Last Updated : 28 Jun, 2021

Consider the following C program

    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;
            n = n - m;
    print f ("% 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

Answer: (C)

Explanation: The given program is iterative implementation of Euclid’s Algorithm for GCD

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!