Spell backwards Program plan: • Include necessary header files. • Declare the class “Main”. • Define the “main()” function. ○ Declare the required variables. ○ The method “Scanner()” is used to get the input from the user. ○ Do the below steps till the condition “while(!response.equals("quit"))” is true. ■ Declare required variables. ■ Get a word from the user and store it in a variable “word”. ■ Create a character array. ■ Assign “word.charAt(0)” to “c”. ■ Loop through the length of the string “word”. • Assign each character to the character array’s index. • Assign the 1 st character of “word” at the last position. ■ Convert the character array to a string and store that string to the variable “str2”. ■ Reverse the string “str2” using “for” loop. ■ Check if both the words “word” and “rev” are equal. • Print the positive message. ■ Else, • Print the negative message. ■ Ask whether the user wants to continue or not. ■ Check if the “response” is equal to “quit”. • Break the loop.

Question

Want to see the full answer?

Answer 1

Question

Chapter 4, Problem 2PP

Program Plan Intro

Spell backwards

Program plan:

• Include necessary header files.

• Declare the class “Main”.

• Define the “main()” function.

○ Declare the required variables.

○ The method “Scanner()” is used to get the input from the user.

○ Do the below steps till the condition “while(!response.equals("quit"))” is true.

■ Declare required variables.

■ Get a word from the user and store it in a variable “word”.

■ Create a character array.

■ Assign “word.charAt(0)” to “c”.

■ Loop through the length of the string “word”.

• Assign each character to the character array’s index.

• Assign the 1^st character of “word” at the last position.

■ Convert the character array to a string and store that string to the variable “str2”.

■ Reverse the string “str2” using “for” loop.

■ Check if both the words “word” and “rev” are equal.

• Print the positive message.

■ Else,

• Print the negative message.

■ Ask whether the user wants to continue or not.

■ Check if the “response” is equal to “quit”.

• Break the loop.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

For all of the following words, if you move the first letter to the end of the word, and then spell the result backwards, you will get the original word:banana dresser grammar potato revive uneven assessWrite a program that reads a word and determines whether it has this property. Continue reading and testing words until you encounter the word quit. Treat uppercase letters as lowercase letters. I need to answer the question in java language

A string of ( {[]}) is given and you have to check this valid parenthesis. Means if a braces is open then it have to close before closing of outer. You have to create a separate class named solution and an another method to check this. In java

Ancay youyay eakspay igpay atinlay? (Can you speak pig latin?) If you can’t, here are the rules: If a word begins with a consonant, take all of the letters before the first vowel and move them to the end of the word, then add ay to the end of the word. Examples: pig → igpay, there → erethay. If a word begins with a vowel (a, e, i, o, u, or y), simply add yay to the end of the word. For this problem, y is always a vowel. Examples: and → andyay, ordinary → ordinaryyay. Although there are many variants of Pig Latin (such as Kedelkloppersprook in Germany), for this problem we will always use the rules described above. A friend of yours was frustrated with everyone writing in Pig Latin and has asked you to write a program to translate to Pig Latin for him. Ouldway youyay ebay osay indkay otay oday ityay? (Would you be so kind to do it?) Inputs consist of lines of text that you will individually translate from a text file given by the user. If the file cannot be opened for some reason,…