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

Questioin: Hidden Secret Problem! In this problem, you are given two names, you have to find whether one name is hidden into another. The restrictions are: You can change some uppercase letters to lower case and vice versa. You can add/remove spaces freely. You can permute the letters. And if both the names match exactly, then you can say that one name is hidden into another. Input Input starts with an integer T (≤ 100), denoting the number of test cases. Each case starts with two lines. Each line contains a name consists of upper/lower case English letters and spaces. You can assume that the length of any name is between 1 and 100(inclusive). Output For each case, print the case number and Yes if one name is hidden into another. Otherwise print No. Sample Input Output 3 Tom Marvolo Riddle I am Lord Voldemort I am not Harry Potter Hi Pretty Roar to man Harry and Voldemort Tom and Jerry and Harry Case 1: Yes Case 2: Yes Case 3: No And I want…

Write an application that reads a five-letter word from the user and produces every possible three-letter string that can be derived from the letters of that word. For example, the three-letter words produced from the word “bathe” include “ate,” “bat,” “bet,” “tab,” “hat,” “the” and “tea.”

Extreme Fizz BuzzFizz Buzz is a classic Computer Science problem about Selection. For an integer x, print:• “Fizz” if x is only divisible by 3,• “Buzz” if x is only divisible by 5,• “FizzBuzz” if x is divisible by both 3 and 5,• the number x if it is not divisible by both 3 and 5.This problem is the extreme version of Fizz Buzz. You are given a list of K distinct integers A and a list of K characters S. Both lists are numbered from 1 to K. The integer Ai corresponds to the character Si. Denote B as the subset of A. There will be a rule for each possible subset: if an integerx is only divisible by all elements in B, print a string which is the concatenation of the corresponding character of each element in B, sorted by the index in ascending order. However, if B is an empty subset, print the first digit of x instead. Does it look complicated? Do not worry, as it is just a generalization of the regular Fizz Buzz. For example, if A = [3, 5] and S = [F, B], you will get the normal Fizz…