Working with Palindromes Program Plan: Include the required header files. Define the “main” function. Accept a string sentence in line string variable. Create an integer variable counter and assign it to 0. Create a vector of string to save tokens. Create an object of stringstream class. Use a loop to tokenizing with respect to space ' '. Use a loop to iterate through vector tokens. Create a string object str. Transform all the tokens into lower case. Assign the value of current token to str. Reverse the value of str. Compare the reversed str value with current token to check whether it is a palindrome or not. If it is a palindrome display the current token. Increment the counter variable. Display the total number of palindromes in the sentence.

Question

Want to see the full answer?

Answer 1

Question

Chapter 21, Problem 21.16E

Program Plan Intro

Working with Palindromes

Program Plan:

Include the required header files.

Define the “main” function.

Accept a string sentence in line string variable.

Create an integer variable counter and assign it to 0.

Create a vector of string to save tokens.

Create an object of stringstream class.

Use a loop to tokenizing with respect to space ' '.

Use a loop to iterate through vector tokens.

Create a string object str.

Transform all the tokens into lower case.

Assign the value of current token to str.

Reverse the value of str.

Compare the reversed str value with current token to check whether it is a palindrome or not.

If it is a palindrome display the current token.

Increment the counter variable.

Display the total number of palindromes in the sentence.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

S A B D FL I C J E G H T K L Figure 1: Search tree 1. Uninformed search algorithms (6 points) Based on the search tree in Figure 1, provide the trace to find a path from the start node S to a goal node T for the following three uninformed search algorithms. When a node has multiple successors, use the left-to-right convention. a. Depth first search (2 points) b. Breadth first search (2 points) c. Iterative deepening search (2 points)

We want to get an idea of how many tickets we have and what our issues are. Print the ticket ID number, ticket description, ticket priority, ticket status, and, if the information is available, employee first name assigned to it for our records. Include all tickets regardless of whether they have been assigned to an employee or not. Sort it alphabetically by ticket status, and then numerically by ticket ID, with the lower ticket IDs on top.

Figure 1 shows an ASM chart representing the operation of a controller. Stateassignments for each state are indicated in square brackets for [Q1, Q0].Using the ASM design technique:(a) Produce a State Transition Table from the ASM Chart in Figure 1.(b) Extract minimised Boolean expressions from your state transition tablefor Q1, Q0, DISPATCH and REJECT. Show all your working.(c) Implement your design using AND/OR/NOT logic gates and risingedgetriggered D-type Flip Flops. Your answer should include a circuitschematic.