Character Converter Class Program Plan: Include required header files. Declare a class named “CharConverter”. Inside “public” access specifier, Declare the functions “uppercase ()” and “properWords ()”. Give function definition for “uppercase ()”. Loop from 0 through the length of the string. Check if the letter is from “a” to “z”. Subtract “32” from the ASCII value of the letter in order to convert the letter to uppercase. Give function definition for “properWords ()”. Check if the length of the string is equal to 0. Return the statement. Check if the character is from “a” to “z”. Subtract “32” from the ASCII value of the first letter in order to convert that letter to uppercase. Loop from 1 through the length of the string. Check if the letter appear after a space are from “a” to “z”. Subtract “32” from the ASCII value of the letter in order to convert the letter to uppercase. Define a function “main ()”. Declare required variables “sentence” and “choice”. Create an object “converter” for the class. Do until the user enters other than the character “y” or “Y”. Get a sentence from the user and store it in a variable “sentence”. Call the function “properWords ()” and print the final result. Call the function “uppercase ()” and print the final result. Return the statement.

Question

Want to see the full answer?

Answer 1

Question

Chapter 8, Problem 11PC

Program Plan Intro

Character Converter Class

Program Plan:

Include required header files.

Declare a class named “CharConverter”.

Inside “public” access specifier,

Declare the functions “uppercase ()” and “properWords ()”.

Give function definition for “uppercase ()”.

Loop from 0 through the length of the string.

Check if the letter is from “a” to “z”.

Subtract “32” from the ASCII value of the letter in order to convert the letter to uppercase.

Give function definition for “properWords ()”.

Check if the length of the string is equal to 0.

Return the statement.

Check if the character is from “a” to “z”.

Subtract “32” from the ASCII value of the first letter in order to convert that letter to uppercase.

Loop from 1 through the length of the string.

Check if the letter appear after a space are from “a” to “z”.

Subtract “32” from the ASCII value of the letter in order to convert the letter to uppercase.

Define a function “main ()”.

Declare required variables “sentence” and “choice”.

Create an object “converter” for the class.

Do until the user enters other than the character “y” or “Y”.

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

Call the function “properWords ()” and print the final result.

Call the function “uppercase ()” and print the final result.

Return the statement.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

I need help to solve a simple problem using Grover’s algorithm, where the solution is not necessarily known beforehand. The problem is a 2×2 binary sudoku with two rules: • No column may contain the same value twice. • No row may contain the same value twice. Each square in the sudoku is assigned to a variable as follows: We want to design a quantum circuit that outputs a valid solution to this sudoku. While using Grover’s algorithm for this task is not necessarily practical, the goal is to demonstrate how classical decision problems can be converted into oracles for Grover’s algorithm. Turning the Problem into a Circuit To solve this, an oracle needs to be created that helps identify valid solutions. The first step is to construct a classical function within a quantum circuit that checks whether a given state satisfies the sudoku rules. Since we need to check both columns and rows, there are four conditions to verify: v0 ≠ v1 # Check top row v2 ≠ v3 # Check bottom row…

1 Vo V₁ V3 V₂ V₂ 2