This is a beta version of Practice-It. Give us feedback

logo Practice-It logo

Main Page → Problems → Solve a Problem

mystery

Language/Type: Java recursion recursive tracing
Author: Stuart Reges (on 2021/04/01)

Consider the following method: 

        public void mystery(int n) {
            System.out.print("+");
            if (n >= 10) {
                mystery(n / 10);
            }

            if (n % 2 == 0) {
                System.out.print("-");
            } else {
                System.out.print("*");
            }
        }

For each call below, indicate what output is produced:

mystery(5);
mystery(15);
mystery(304);
mystery(9247);
mystery(43269);

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.