Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
10. Exercise 9 - Strings (Assessed Exercise) Important: Do not attempt this exercise before completing Exercises 6, 7 and 8. Think how to reuse the functions you created in Exercises 6, 7 and 8. Design and Problem Solving: Create an algorithm for a program that reads a string with a maximum length of N from the keyboard (N should be specified by the user). N should not be more than 100. ● The algorithm should then copy the characters from that input string into a second character array (in the order of input). However, a character will be copied into the second array only if it is a vowel (i.e., a, e, i, o, u). This second array should be allocated dynamically and its size will depend on the number of characters that will be copied into it. 4 Murdoch UNIVERSITY Once copied, the algorithm should output the values stored in the second string. 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: Implement the algorithm that you designed using C programming language. Important note: Remember that 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 السم

10. Exercise 9 - Strings (Assessed Exercise) Important: Do not attempt this exercise before completing Exercises 6, 7 and 8. Think how to reuse the functions you created in Exercises 6, 7 and 8. Design and Problem Solving: Create an algorithm for a program that reads a string with a maximum length of N from the keyboard (N should be specified by the user). N should not be more than 100. ● The algorithm should then copy the characters from that input string into a second character array (in the order of input). However, a character will be copied into the second array only if it is a vowel (i.e., a, e, i, o, u). This second array should be allocated dynamically and its size will depend on the number of characters that will be copied into it. 4 Murdoch UNIVERSITY Once copied, the algorithm should output the values stored in the second string. 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: Implement the algorithm that you designed using C programming language. Important note: Remember that 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 السم

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question
100%
10. Exercise 9 - Strings (Assessed Exercise) Important: Do not attempt this exercise before completing Exercises 6, 7 and 8. Think how to reuse the functions you created in Exercises 6, 7 and 8. Design and Problem Solving: Create an algorithm for a program that reads a string with a maximum length of N from the keyboard (N should be specified by the user). N should not be more than 100. The algorithm should then copy the characters from that input string into a second character array (in the order of input). However, a character will be copied into the second array only if it is a vowel (i.e., a, e, i, o, u). This second array should be allocated dynamically and its size will depend on the number of characters that will be copied into it. Murdoch UNIVERSITY Once copied, the algorithm should output the values stored in the second string. 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: Implement the algorithm that you designed using C programming language. Important note: Remember that 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. Modular programming means you need to use multiple functions and multiple .c and .h files.
Transcribed Image Text:10. Exercise 9 - Strings (Assessed Exercise) Important: Do not attempt this exercise before completing Exercises 6, 7 and 8. Think how to reuse the functions you created in Exercises 6, 7 and 8. Design and Problem Solving: Create an algorithm for a program that reads a string with a maximum length of N from the keyboard (N should be specified by the user). N should not be more than 100. The algorithm should then copy the characters from that input string into a second character array (in the order of input). However, a character will be copied into the second array only if it is a vowel (i.e., a, e, i, o, u). This second array should be allocated dynamically and its size will depend on the number of characters that will be copied into it. Murdoch UNIVERSITY Once copied, the algorithm should output the values stored in the second string. 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: Implement the algorithm that you designed using C programming language. Important note: Remember that 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. Modular programming means you need to use multiple functions and multiple .c and .h files.
Expert Solution
steps

Step by step

Solved in 7 steps with 4 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Types of Function
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS