logo Practice-It logo

Recursive Tracing

Language/Type: Java mod recursion recursive tracing
Author: Stuart Reges (on 2014/02/13)

Consider the following method:

    public int mystery(int x, int y) {
        if (x % 2 == 1 || y % 2 == 1) {
            return 1;
        } else {
            return 2 * mystery(x / 2, y / 2);
        }
    }

For each call below, indicate what value is returned:

mystery(4, 19)
mystery(32, 56)
mystery(12, 20)
mystery(4, 18)
mystery(48, 128)

You must log in before you can solve this problem.


Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.