Vowels and Consonants Program Plan: • Declare a function named “vowelsCount()” that accepts a string “my_string” as input. Inside the function, ○ Create a counter variable “cnt1” to store the number of vowels in the string. ○ Use the “for” loop to process all the characters in the “my_string” to check for vowels. ○ Inside the “for” loop, ■ Check if the current character “ch” is the alphabet. ■ If so, then check if the current character “ch” is the vowel. ■ If condition is true, then increment the “cnt1” value by “1”. ○ After processing all the characters in the “my_string”, return the counter “cnt1” value. • Declare a function named “consonantsCount()” that accepts a string “my_string” as input. Inside the function, ○ Create a counter variable “cnt2” to store the number of consonants in the “my_string”. ○ Use the “for” loop to process all the characters in the “my_string” to check for consonants. ○ Inside the “for” loop, ■ Check if the current character “ch” is the alphabet. ■ If so, then check if the current character “ch” is not a vowel. ■ If the condition is true, then increment the “cnt2” value by “1”. ○ After processing all the characters in the “my_string”, return the counter “cnt2” value. • Declare a function named “main()”. In the “main()” function, ○ Get a string from the user and store it in the “my_string” variable. ○ Call the function “vowelsCount()” to count the vowels and pass “my_string” as input to the function and store the return count in “count1”. ○ Call the function “consonantsCount()” to count the consonants and pass “my_string” as input to the function and store the return count in “count2”. ○ Display “count1” and “count2” 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 9PE

Program Plan Intro

Vowels and Consonants

Program Plan:

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

○ Create a counter variable “cnt1” to store the number of vowels in the string.

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

○ Inside the “for” loop,

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

■ If so, then check if the current character “ch” is the vowel.

■ If condition is true, then increment the “cnt1” value by “1”.

○ After processing all the characters in the “my_string”, return the counter “cnt1” value.

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

○ Create a counter variable “cnt2” to store the number of consonants in the “my_string”.

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

○ Inside the “for” loop,

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

■ If so, then check if the current character “ch” is not a vowel.

■ If the condition is true, then increment the “cnt2” value by “1”.

○ After processing all the characters in the “my_string”, return the counter “cnt2” value.

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

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

○ Call the function “vowelsCount()” to count the vowels and pass “my_string” as input to the function and store the return count in “count1”.

○ Call the function “consonantsCount()” to count the consonants and pass “my_string” as input to the function and store the return count in “count2”.

○ Display “count1” and “count2” 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

What is the worst case time complexity of the following algorithm for i = 1 to x do for j = 2^((i-1)x) to 2^(in) do print(i,j)

Prove for each pair of expression f(n) and g(n) whether f(n) is big O, little o Ω,ω or Θ of g(n). For each case it is possible that more than one of these conditions is satisfied:1. f(n) =log(n2^n), g(n) = log(sqrt(n)2^(n^2))2. f(n) =nsqrt(n) +log(n^n), g(n) =n + sqrt(n)logn

I need to make a parallel version of this sequential code