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 11.19: mapMystery1

Language/Type: Java Collection mystery Sets and Maps
Author: Marty Stepp (on 2013/04/01)

Write the output that is printed when the given method below is passed each of the following maps as its parameter. Assume that each parameter map stores its key/value pairs in exactly the order shown, and that is the order in which a for-each loop would examine them. Recall that maps print in a {key1=value1, key2=value2, ..., keyN=valueN} format. Your answer should display the right keys and values in the right order. 

public static void mapMystery1(Map<String, String> map) {
    Map<String, String> result = new TreeMap<String, String>();
    for (String key : map.keySet()) {
        if (key.compareTo(map.get(key)) < 0) {
            result.put(key, map.get(key));
        } else {
            result.put(map.get(key), key);
        }
    }
    System.out.println(result);
}
{two=deux, five=cinq, one=un, three=trois, four=quatre}
{skate=board, drive=car, program=computer, play=computer}
{siskel=ebert, girl=boy, heads=tails, ready=begin, first=last, begin=end}
{cotton=shirt, tree=violin, seed=tree, light=tree, rain=cotton}

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.