Important Notice:

Practice-It will be discontinued as of November 1st, 2024. After this date, the website will remain online for a transitional period, but login will be restricted to University of Washington NetID authentication. This marks the next phase towards the platform's full retirement. Thank you for your use and support of the application over the years.

If you are looking for an alternative, a similar tool, CodeStepByStep, was developed independently by the original author of Practice-It, and is available at codestepbystep.com**

logo Practice-It logo

Main Page → Problems → Solve a Problem

BJP3 Self-Check 14.17: stackQueueMystery2

Language/Type: Java Collections mystery Stacks and Queues
Author: Marty Stepp (on 2013/04/01)

Write the output produced when the following method is passed each of the following queues. Recall that stacks and queues print in an [a, b, c] format from bottom/front to top/back. 

public static void mystery2(Queue<Integer> q) {
    Stack<Integer> s = new Stack<Integer>();
    int size = q.size();
    for (int i = 0; i < size; i++) {
        int n = q.remove();
        if (n % 2 == 0) {
            s.push(n);
        } else {
            q.add(n);
        }
    }
    System.out.println(q + " " + s);
}
[1, 2, 3, 4, 5, 6]
[42, -3, 4, 15, 9, 71]
[30, 20, 10, 60, 50, 40, 3, 0]

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.