logo Practice-It logo

Main Page → Problems → Solve a Problem

BJP5 Self-Check 12.15: mystery6

Language/Type: Java recursion recursive tracing
Author: Marty Stepp (on 2019/09/19)

For each call to the following method, indicate what value is returned: 

public static int mystery6(int n, int k) {
    if (k == 0 || k == n) {
        return 1;
    } else if (k > n) {
        return 0;
    } else {
        return mystery6(n - 1, k - 1) + mystery6(n - 1, k);
    }
}
mystery6(7, 1)
mystery6(4, 2)
mystery6(4, 3)
mystery6(5, 3)
mystery6(5, 4)

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.