Most Frequent Character Program Plan: • Declare a function named “findFrequentCharacter()” that accepts a string “my_string” as input. Inside the function, ○ Create a list variable “countList” to store the frequency of all alphabets. ○ Use the “for” loop to process all the characters in the “my_string” to check for frequency. ○ Inside the “for” loop, ■ Check if the current character “ch” is the alphabet. ■ If so, then find the ASCII value of the character and store it in “n”. ■ Check if the ASCII value of the character indicates the uppercase alphabet. ■ If the condition is true, then find the index of the character in the “countList” by subtracting “65” from “n”. ■ If the condition fails, then ASCII value of the character indicates the lowercase alphabet. ■ Thus, find the index of the character in the “countList” by subtracting “97” from “n” value and store it in “n”. ■ Using the “n” as the index, increment the value at “n” in the “countList” by “1”. ○ After processing all the characters in the “my_string”, declare a variable “maxVal” to hold the highest value of occurrences. ○ Also, declare a variable “maxValPos” to hold the position of the “maxVal” in the “countList”. ○ Use the “for” loop to find the highest value in the “countList”. ○ Inside the “for” loop, ■ Check if the current value is higher than “maxVal”. ■ If so, then update the “maxVal” with the current value and update the “maxValPos”. ○ Convert the “maxVal” into the ASCII value by adding “97” with it. ○ After that, convert the “maxVal” into character and return it. • Declare a function named “main()”. Inside the “main()” function, ○ Get a string from the user and store it in “my_string” variable. ○ Call the function “findFrequentCharacter()” and pass “my_string” as input to the function and store the return value in “frequentCharacter”. ○ Display the “frequentCharacter” using the “print()” function. • In the last, call the function “main()” to execute the program.

Question

Want to see the full answer?

Answer 1

Question

Chapter 8, Problem 11PE

Program Plan Intro

Most Frequent Character

Program Plan:

• Declare a function named “findFrequentCharacter()” that accepts a string “my_string” as input. Inside the function,

○ Create a list variable “countList” to store the frequency of all alphabets.

○ Use the “for” loop to process all the characters in the “my_string” to check for frequency.

○ Inside the “for” loop,

■ Check if the current character “ch” is the alphabet.

■ If so, then find the ASCII value of the character and store it in “n”.

■ Check if the ASCII value of the character indicates the uppercase alphabet.

■ If the condition is true, then find the index of the character in the “countList” by subtracting “65” from “n”.

■ If the condition fails, then ASCII value of the character indicates the lowercase alphabet.

■ Thus, find the index of the character in the “countList” by subtracting “97” from “n” value and store it in “n”.

■ Using the “n” as the index, increment the value at “n” in the “countList” by “1”.

○ After processing all the characters in the “my_string”, declare a variable “maxVal” to hold the highest value of occurrences.

○ Also, declare a variable “maxValPos” to hold the position of the “maxVal” in the “countList”.

○ Use the “for” loop to find the highest value in the “countList”.

○ Inside the “for” loop,

■ Check if the current value is higher than “maxVal”.

■ If so, then update the “maxVal” with the current value and update the “maxValPos”.

○ Convert the “maxVal” into the ASCII value by adding “97” with it.

○ After that, convert the “maxVal” into character and return it.

• Declare a function named “main()”. Inside the “main()” function,

○ Get a string from the user and store it in “my_string” variable.

○ Call the function “findFrequentCharacter()” and pass “my_string” as input to the function and store the return value in “frequentCharacter”.

○ Display the “frequentCharacter” using the “print()” function.

• In the last, call the function “main()” to execute the program.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

using r language

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…

using r language