a) Write a method encrypt(String text, int key) that returns a String. This method does two things to the string text: 1. First, it reverses the order of its words (“hello there” becomes “there hello”). 2. The second thing is incrementing the characters’ ascii code by key. For example, if the key is equal to 2, “hello” becomes “jgnnq” (since ‘h’ + 2 = ‘j’ and so on). Note that this second step does not apply to the space character so a space remains a space. For example, "Humming birds" for a key equal to 4 becomes: "fmvhw Lyqqmrk". b) Write a test program that prompts the user to enter a line of text and a key then calls the method encrypt to display the encryption of the input text.

a) Write a method encrypt(String text, int key) that returns a String. This method does two things to the string text: 1. First, it reverses the order of its words (“hello there” becomes “there hello”). 2. The second thing is incrementing the characters’ ascii code by key. For example, if the key is equal to 2, “hello” becomes “jgnnq” (since ‘h’ + 2 = ‘j’ and so on). Note that this second step does not apply to the space character so a space remains a space. For example, "Humming birds" for a key equal to 4 becomes: "fmvhw Lyqqmrk". b) Write a test program that prompts the user to enter a line of text and a key then calls the method encrypt to display the encryption of the input text.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter7: Characters, Strings, And The Stringbuilder

Section: Chapter Questions

Problem 12RQ

See similar textbooks

Similar questions

Write a method that finds the number ofoccurrences of a specified character in a string using the following header:public static int count(String str, char a) For example, count("Welcome", 'e') returns 2. Write a test program thatprompts the user to enter a string followed by a character then displays the numberof occurrences of the character in the string.
Write a method that finds the number of occurrences of a specified character in a string using thefollowing header:public static int countLetter(String str, char ch)Write a test program that prompts the user to enter a word and a letter of the alphabet. Theprogram should then count and display the number of occurrences of the letter in the word. Asample dialog for the program is shown below:
Write a function that finds the number of occurrences of a specified character in a string using the following header:def count(s, ch):The str class has the count method. Implement your method without using the count method. For example, count("Welcome", 'e') returns 2. Write a test program that prompts the user to enter a string followed by a character and displays the number of occurrences of the character in the string.
Language :Python write a program that asks the user to enter a series of single digit numbers with nothing seperating them. The program should display the sum of all the single digit numbers in the string. For example, if the user enters 2514 the method should return 12, which is hw sum of 2,5,1 and 4. write a program that reads a string from the user containing a date in the form mm/dd/yy. it should print the date in the format March 12, 2018.
Language: Java Write a program that reads a sentence from the keyboard. Depending on the last character of the sentence, print the message identifying the sentence as declarative (ends with a period), interrogative (ends with a question mark), exclamatory (end with an exclamation point), or other. Hint: you can use charAt() method from the String class to extract the last character of the input line. The character of a String str is at str.length()-1 position. For taking a sentence as input use the nextLine() method from the Scanner class. You have to use if/else if selection. Sample input and output: Sample 1 Input: How are you? Output: Interrogative Sample 2 Input: I am good. Output: Declarative Sample 3 Input: That is amazing! Output: Exclamatory Sample 4 Input: Although, Output: Other Answer:
Lab Task 04: Include the methods in the file KMP_Implementation.txt in a complete Java program that prompts for and reads a text string and then a text pattern to search for in the text. It then displays the result of the search. Sample program runs: Enter the text: ABABСАВАВАВСАВАВСАВАВСАВАВКККАВАВСАВАВ Enter the pattern to search for: ABABCABAB Pattern found at these text starting indexes: 0 Enter the text: A KFUPM STUDENT Enter the pattern to search for: KFE Pattern not in text. 7 12 17 29
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string.This problem is an exercise in Java string manipulation. For some mysterious reason, the Java String type does not come with a reverse method. The canonical way to reverse a Java string str is to first convert it to mutable StringBuilder, reverse its contents, and convert the result back to an immutable string, that is,str = new StringBuilder(str).reverse().toString(); Here's the tester it must pass: @Test public void testPancakeScramble() throws IOException {// Explicit test casesassertEquals("", P2J3.pancakeScramble(""));assertEquals("alu",…
Problem: String Encryption Write a method Encrypt(char letter), which encrypts a given letter in the following way: It takes the first and the last digit from the ASCII code of the letter and concatenates them into a string, which will represent the result. In the beginning of the string, which represents the result, we will insert the symbol which matches the following condition: ASCII code of the letter + the last digit of the ASCII code of the letter. After that in the end of the string, which represents the result, you concatenate the character which matches the following condition: ASCII code of the letter - the first digit of the ASCII code of the letter. The method should return the encrypted string. Example: j → p16i ASCII code of j is 106 → First digit – 1, last digit – 6. We concatenate the first and the last digit → 16. At the beginning of the string, which represents the result, concatenate the symbol, which you get from the sum of the ASCII code + the last…
Using Java, Write a value-returning method, isVowel that returns the value true if a given character is a vowel, and otherwise returns false. In main() method accept a string from user and count number of vowels in that string.
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string. This problem is an exercise in Java string manipulation. For some mysterious reason, the Java String type does not come with a reverse method. The canonical way to reverse a Java string str is to first convert it to mutable StringBuilder, reverse its contents, and convert the result back to an immutable string, that is, str = new StringBuilder(str).reverse().tostring(); A bit convoluted, but does what is needed without fuss or muss. Maybe one day the Java strings will come with the reverse method built in, just like the string data types of all sensible…
java: Run length coding is a method to represent a string in a more compact manner. Each character that occurs more than 2 times in a row is represented by the character and a number following it. Two examples are: "abba" → "abba""abcccbbbba" → "abc3b4a"Write a function that calculates how many characters the encoded string is shorter than the original.