Free Response - String Scramble B

Section 4.35 Free Response - String Scramble B

The following is part b of a free response question from 2014. It was question 1 on the exam. You can see all the free response questions from past exams at https://apstudents.collegeboard.org/courses/ap-computer-science-a/free-response-questions-by-year

https://apstudents.collegeboard.org/courses/ap-computer-science-a/free-response-questions-by-year

🔗

Question 1. This question involves reasoning about strings made up of uppercase letters. You will implement two related methods that appear in the same class (not shown). The first method takes a single string parameter and returns a scrambled version of that string. The second method takes a list of strings and modifies the list by scrambling each entry in the list. Any entry that cannot be scrambled is removed from the list.

🔗

Part b. Write the method scrambleOrRemove, which replaces each word in the parameter wordList with its scrambled version and removes any words that are unchanged after scrambling. The relative order of the words in wordList remains the same as before the call to scrambleOrRemove.

🔗

The following example shows how the contents of wordList would be modified as a result of calling scrambleOrRemove.

🔗

Figure 4.35.1. Example call and result
🔗

Assume that the method scrambleWord works as intended and is in the same class. It will return the scrambled word or the same word. You will write the scrambleOrRemove method to replace each original word with the scrambled word or remove the word if it was not scrambled.

🔗

import java.util.List;

public class ScrambledStrings
{

    /**
     * Modifies wordList by replacing each word with its scrambled version,
     * removing any words that are unchanged as a result of scrambling.
     *
     * @param wordList the list of words Precondition: wordList contains only
     *     non-null objects Postcondition: - all words unchanged by scrambling have
     *     been removed from wordList - each of the remaining words has been
     *     replaced by its scrambled version - the relative ordering of the entries
     *     in wordList is the same as it was before the method was called
     */
    public static void scrambleOrRemove(List<String> wordList)
    {
        /* to be implemented in part b */
    }
}

Subsection 4.35.1 How to solve this problem

Activity 4.35.1.

Explain in plain English what your code will have to do to answer this question. Use the variable names given above.

🔗

This section contains a plain English explanation of one way to solve this problem as well as problems that test your understanding of how to write the code to do those things.

🔗

In the example the first word (at index 0) TAN is scrambled and replaced. The second word ABRACADABRA (at index 1) is scrambled and replaced. The third word WHOA (at index 2) is removed. The fourth word APPLE (at index 3) is scrambled and replaced. The fifth word EGGS (at index 4) is removed since the scrambled word is the same as the original. What method of List allows you to replace an element in a list? What method of list allows you to remove an element from a list? How can you loop through a list and not always increment the current index?

🔗

Activity 4.35.2.

What is returned by this method?

🔗

String
🔗
Reread the method header, the datatype returned is to the left of the method name.
ArrayList
🔗
Reread the method header, the datatype returned is to the left of the method name.
Array
🔗
Reread the method header, the datatype returned is to the left of the method name.
void
🔗
Correct!

🔗

Activity 4.35.3.

This method accepts an ArrayList, what is the datatype of the objects contained in this ArrayList?

🔗

void
🔗
you cannot have an ArrayList of type void
String
🔗
Correct!
List
🔗
This is not an ArrayList of more Lists
int
🔗
This list does not contain integers.

🔗

Activity 4.35.4.

There are many ways to use loops to solve this problem. If we were to use a while loop, what conditional could we write to make sure the loop does not go out of bounds? (Assume an integer index has already been initialized).

🔗

(index != wordList.current())
🔗
the .current() method does not exist
(int index = wordList.size() - 1; index >= 0; index--)
🔗
this form of range control does not work with while loops
(index < wordList.size())
🔗
Correct!
(wordList(index) != wordList.size())
🔗
this does not accurately update the list as you iterate through wordList

🔗

Activity 4.35.5.

You can also use a for loop to solve this problem instead of a while loop. what conditional could we write to make sure the loop does not go out of bounds?

🔗

(int i = wordList.size() - 1; i != wordList.size(); i--)
🔗
this will lead to an infinite loop
(int i = wordList.size() - 1; i >= 0; i--)
🔗
Correct!
(int i = wordList.size(); i >= 0; i--)
🔗
This loop starts out of bounds since there isn’t an element at wordList.size().
(int i = wordList.size() - 1; i > 0; i--)
🔗
This loop doesn’t iterate all the way through the wordList. It misses the 0th element.

🔗

Activity 4.35.6.

How would you access each element in wordList assuming you already have an integer index properly initialized.

🔗

wordList.get(index)
🔗
Correct!
wordList[index]
🔗
This accessor method doesn’t work for arrayLists.
wordList(index)
🔗
This accessor method doesn’t work for arrayLists.
wordList.at(index)
🔗
This accessor method doesn’t work for arrayLists.

🔗

Activity 4.35.7.

How would you check that a string word is equal to a different string called other?

🔗

!(word != other)
🔗
This checks to make sure that word does not equal a different space in memory that other.
word.size() == other.size()
🔗
This only checks the size of the strings, it does not check for equality
word == other
🔗
This checks the actual addresses in memory of the strings, not their contents.
word.equals(other)
🔗
Correct!

🔗

Subsection 4.35.2 The Algorithm

Loop through the list and scramble the current word. If the scrambled word and original are equal then remove the word from the list and otherwise replace it. We will have to be careful since the size of the list can change in the loop. If we remove an element all the other elements will shift left. We will only want to increment the index if the word was replaced and not removed. There are many ways to solve this problem but we have outlined 2 in the following optional questions. If you feel that you are ready to solve the problem, please skip ahead to the active code block.

🔗

public static void scrambleOrRemove(List<String> wordList)
    initialize index counter
    while (index less than wordlist size)
      initialize a string and set it equal to word in wordList at index

      initialize another string and set it equal to the scrambled version
      of the word in wordlist at index

      if (the normal string equals the scrambled string)
          remove the word in wordList at the current index
      else
          reassign the current word in wordList to be the scrambled version
          iterate the index

Activity 4.35.8.

The method test below contains the correct code for one solution to this problem, but it is mixed up. Drag the needed code from the left to the right and put them in order with the correct indention so that the code would work correctly.

🔗

public static void test(List<String> wordList)
{
---
  int i = 0;
  while (i < wordList.size())
  {
---
     String current = wordList.get(i);
     String scrambled = scrambleWord(current);
---
     if (scrambled.equals(current))
---
        wordList.remove(i);
---
     else
     {
---
        wordList.set(i,scrambled);
---
        i++;
---
     } // end else
---
  } // end while
---
} // end method

🔗

Another way to solve this problem is to start at the end of the list and loop towards the front of the list. That way you don’t have to worry about the index being off if you remove an item from the list.

🔗

public static void scrambleOrRemove(List<String> wordList)
      for( int i = wordList size - 1; i >= 0; i--)
          initialize a string and set it equal to word in wordList at index

          initialize another string and set it equal to the scrambled version
          of the word in wordlist at index

          if (the normal string equals the scrambled string)
              remove the word in wordList at the current index
          else
              reassign the current word in wordList to be the scrambled version
              iterate the index

Activity 4.35.9.

The method test below contains the correct code for another solution to this problem, but it is mixed up. Drag the needed code from the left to the right and put them in order with the correct indention so that the code would work correctly.

🔗

public static void test(List<String> wordList)
{
---
   for (int i = wordList.size() - 1; i >= 0; i--)
   {
---
      String word = wordList.get(i);
---
      String scrambled = scrambleWord(word);
---
      if (!scrambled.equals(word))
---
        wordList.set(i, scrambled);
---
      else
---
        wordList.remove(i);
---
   } // end for
---
} // end method

🔗

Subsection 4.35.3 Try and Solve It

Activity 4.35.10.

Write the method scrambleOrRemove below. The main has code to test the result.

🔗

import java.util.ArrayList;
import java.util.List;

public class ScrambledStrings
{

/**
     * Scrambles a given word.
     *
     * @param word the word to be scrambled
     * @return the scrambled word (possibly equal to word) Precondition: word is
     *     either an empty string or contains only uppercase letters.
     *     Postcondition: the string returned was created from word as follows: -
     *     the word was scrambled, beginning at the first letter and continuing
     *     from left to right - two consecutive letters consisting of "A" followed
     *     by a letter that was not "A" were swapped - letters were swapped at most
     *     once
     */
    public static String scrambleWord(String word)
    {
        String scrambled = "";
        int i = 0;

while (i < word.length())
        {
            String letter1 = word.substring(i, i + 1);
            String letter2 = "";
            if (i < word.length() - 1)
            {
                letter2 = word.substring(i + 1, i + 2);
            }
            if (letter1.equals("A")
                    && !letter2.equals("A")
                    && !letter2.equals(""))
            {
                scrambled += letter2 + letter1;
                i += 2;
            }
            else
            {
                scrambled += letter1;
                i += 1;
            }
        }
        return scrambled;
    }

/********************** Part (b) *********************/

/**
     * Modifies wordList by replacing each word with its scrambled version,
     * removing any words that are unchanged as a result of scrambling.
     *
     * @param wordList the list of words Precondition: wordList contains only
     *     non-null objects Postcondition: - all words unchanged by scrambling have
     *     been removed from wordList - each of the remaining words has been
     *     replaced by its scrambled version - the relative ordering of the entries
     *     in wordList is the same as it was before the method was called
     */
    public static void scrambleOrRemove(List<String> wordList) {}

/********************** Test *********************/

public static void main(String[] args)
    {

System.out.println("\nTesting Part (b):\n");

String[] words2 = {"TAN", "ABRACADABRA", "WHOA", "APPLE", "EGGS"};
        ArrayList<String> wordList = new ArrayList<String>();
        for (String word : words2) wordList.add(word);
        System.out.print(wordList);
        scrambleOrRemove(wordList);
        System.out.println(" ==> " + wordList);
    }
}
====
import static org.junit.Assert.*;

import org.junit.*;

import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;

@SuppressWarnings("unchecked")
public class RunestoneTests extends CodeTestHelper
{
    public RunestoneTests()
    {
        super("ScrambledStrings");
    }

@Test
    public void testMain() throws IOException
    {
        String output = getMethodOutput("main");
        String expect = "[TNA, BARCADABARA, PAPLE]";
        boolean passed = output.contains(expect);
        passed = getResults(expect, output, "expected output from main", passed);
        assertTrue(passed);
    }

@Test
    public void test1()
    {
        ArrayList<String> wordList =
                new ArrayList(Arrays.asList("TAN", "ABRACADABRA", "WHOA", "APPLE", "EGGS"));

ArrayList<String> wordListExpect =
                new ArrayList<String>(Arrays.asList("TNA", "BARCADABARA", "PAPLE"));

ScrambledStrings.scrambleOrRemove(wordList);

boolean result = wordList.equals(wordListExpect);

boolean passed =
                getResults(
                        "true",
                        "" + result,
                        "scrambleOrRemove works for ArrayList #1: TAN, ABRACADABRA, WHOA, APPLE,"
                            + " EGGS");

assertTrue(passed);
    }

@Test
    public void test2()
    {
        ArrayList<String> wordList = new ArrayList(Arrays.asList("TESTING", "ONE", "TWO", "THREE"));

ArrayList<String> wordListExpect = new ArrayList<String>(Arrays.asList());

ScrambledStrings.scrambleOrRemove(wordList);

boolean result = wordList.equals(wordListExpect);

boolean passed =
                getResults(
                        "true",
                        "" + result,
                        "scrambleOrRemove works for ArrayList #2: TESTING, ONE, TWO, THREE");

assertTrue(passed);
    }
}

🔗

You have attempted of activities on this page.

🔗

Prev Top Next