Question 4. In this question you will write two methods for a class RouteCipher that encrypts (puts into a coded form) a message by changing the order of the characters in the message. The route cipher fills a two-dimensional array with single-character substrings of the original message in row-major order, encrypting the message by retrieving the single-character substrings in column-major order.
public class RouteCipher
{
/**
* A two-dimensional array of single-character strings, instantiated in the
* constructor
*/
private String[][] letterBlock;
/** The number of rows of letterBlock, set by the constructor */
private int numRows;
/** The number of columns of letterBlock, set by the constructor */
private int numCols;
/**
* Places a string into letterBlock in row-major order.
*
* @param str the string to be processed Postcondition: if str.length() <
* numRows * numCols, "A" in each unfilled cell if str.length() > numRows *
* numCols, trailing characters are ignored
*/
public void fillBlock(String str)
{
/* to be implemented in part (a) */
}
/**
* Extracts encrypted string from letterBlock in column-major order.
* Precondition: letterBlock has been filled
*
* @return the encrypted string from letterBlock
*/
private String encryptBlock()
{
/* implementation not shown */
}
/**
* Encrypts a message.
*
* @param message the string to be encrypted
* @return the encrypted message; if message is the empty string, returns the
* empty string
*/
public String encryptMessage(String message)
{
/* to be implemented in part (b) */
}
// There may be instance variables, constructors, and methods that are not
// shown
}
Part a. Write the method fillBlock that fills the two-dimensional array letterBlock with one-character strings from the string passed as parameter str.
The array must be filled in row-major orderβthe first row is filled from left to right, then the second row is filled from left to right, and so on, until all rows are filled.
If the length of the parameter str is smaller than the number of elements of the array, the string βAβ is placed in each of the unfilled cells. If the length of str is larger than the number of elements in the array, the trailing characters are ignored.
For example, if letterBlock has 3 rows and 5 columns and str is the string βMeet at noonβ, the resulting contents of letterBlock would be as shown in the following table.
If letterBlock has 3 rows and 5 columns and str is the string βMeet at midnightβ, the resulting contents of letterBlock would be as shown in the following table.
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.
Although this could would, we would need some kind of tracker variable to allow use to count indexes which would be more easily accomplished by a different loop.
Try using this formula to find a given character of one of the example strings. Does it work? Try coming up with some of your own examples to figure out the forumla for k.
Try using this formula to find a given character of one of the example strings. Does it work? Try coming up with some of your own examples to figure out the forumla for k.
Try using this formula to find a given character of one of the example strings. Does it work? Try coming up with some of your own examples to figure out the forumla for k.
The method fillBlock 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 void fillBlock(String str)
{
int pos = 0;
---
for (int r = 0; r < this.numRows; r++ )
{
---
for (int c = 0; c < this.numCols; c++ )
{
---
if (pos < str.length())
{
---
String subStr = str.substring(pos, pos+1);
this.letterBlock[r][c] = subStr;
pos++;
---
} else
{
this.letterBlock[r][c] = "A";
} // end else block
---
} // end inner for
} // end outer for
} // end method