Create an algorithm for a program that reads a string with a maximum length of 30 from the keyboard[1]. The algorithm should then copy the characters from that input string into a second character array (in order of input). However, only if a character is a vowel (a, e, i, o, u) should it be copied into the second array. Once copied, the algorithm should output the values stored in the second array (in order of input). The algorithm should then count and display the number of times each vowel appears in the second array. Also, the algorithm should determine and output the index in the second array where each vowel first appeared or display a suitable message if a particular vowel is not in the array at all. Your solution must be modular in design; you should consider in your design the issues of high cohesion and code re-use (refer to the lecture notes for module four, on modular design and programming). (Programming exercise) Implement the program from Question 1 into a C program. The program should take suitable steps to trap and recover from errors. Implement the program from Question 1 into a C program. The program should take suitable steps to trap and recover from errors. [1] Remember strings differ from a regular character array by the inclusion of the null character (‘\0’) following the last alphabetical character. A regular character array just stored characters and does not include null.
- (Design/Problem Solving)
Create an
Your solution must be modular in design; you should consider in your design the issues of high cohesion and code re-use (refer to the lecture notes for module four, on modular design and
- (Programming exercise)
Implement the program from Question 1 into a C program. The program should take suitable steps to trap and recover from errors.
Implement the program from Question 1 into a C program. The program should take suitable steps to trap and recover from errors.
[1] Remember strings differ from a regular character array by the inclusion of the null character (‘\0’) following the last alphabetical character. A regular character array just stored characters and does not include null.
Step by step
Solved in 3 steps with 1 images
