1- Write a function that takes a word less than 25 characters long and returns the letter that word starts with (in capital letters). Frank starts with the letter F. 2- Write a function that has a string as formal parameter. The function then replaces all spaces and punctuation marks in the string with the asterisk (*). Here is a sample run: Nothing is impossible, the word itself says 'I'm possible'! Nothing*is*impossible**the*word*itself*says*I*m*possible** 3- Write a function that takes as input one line and reverses the words of the line. For example, birds and bees Reversed: bees and birds 4- Write a function that takes nouns (a string) as inputs and forms their plurals based on these rules: a. If noun ends in "y", remove the "y" and add "ies". b. If noun ends in "s","ch", or "sh", add "es". c. In all other cases, just add "s". (Test on the following: chair dairy boss circus fly dog church clue dish) chairs dairies bosses circuses flies dogs churches clues dishes Now create the driver program, - Ask the user for their first and last name. Store the names in separate arrays. - Greet the user by their full names. Let them know what their initials are by calling the function in part 1. Ask them to input their favorite quote. Call function in part 2 to change the quote. Now call the function in line 3 and have the quote reversed. Finally, ask them to put in some nouns and pluralize each noun using the function in part 4. Continue evaluating nouns till the user inputs QUIT.

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
icon
Related questions
Question
1- Write a function that takes a word less than 25 characters long and returns the letter that
word starts with (in capital letters).
Frank starts with the letter F.
2- Write a function that has a string as formal parameter. The function then replaces all spaces
and punctuation marks in the string with the asterisk (*). Here is a sample run:
Nothing is impossible, the word itself says 'I'm possible'!
Nothing*is*impossible**the*word*itself*says**I*m*possible**
3- Write a function that takes as input one line and reverses the words of the line.
For example,
birds and bees
Reversed: bees and birds
4- Write a function that takes nouns (a string) as inputs and forms their plurals based on these
rules:
a. If noun ends in "y", remove the "y" and add "ies".
b. If noun ends in "s","ch", or "sh", add "es".
c. In all other cases, just add "s".
(Test on the following: chair dairy boss circus fly dog church clue dish)
chairs dairies bosses circuses flies dogs churches clues dishes
Now create the driver program,
Ask the user for their first and last name. Store the names in separate arrays.
- Greet the user by their full names.
Let them know what their initials are by calling the function in part 1.
Ask them to input their favorite quote. Call function in part 2 to change the quote.
Now call the function in line 3 and have the quote reversed.
Finally, ask them to put in some nouns and pluralize each noun using the function in part
4. Continue evaluating nouns till the user inputs QUIT.
Transcribed Image Text:1- Write a function that takes a word less than 25 characters long and returns the letter that word starts with (in capital letters). Frank starts with the letter F. 2- Write a function that has a string as formal parameter. The function then replaces all spaces and punctuation marks in the string with the asterisk (*). Here is a sample run: Nothing is impossible, the word itself says 'I'm possible'! Nothing*is*impossible**the*word*itself*says**I*m*possible** 3- Write a function that takes as input one line and reverses the words of the line. For example, birds and bees Reversed: bees and birds 4- Write a function that takes nouns (a string) as inputs and forms their plurals based on these rules: a. If noun ends in "y", remove the "y" and add "ies". b. If noun ends in "s","ch", or "sh", add "es". c. In all other cases, just add "s". (Test on the following: chair dairy boss circus fly dog church clue dish) chairs dairies bosses circuses flies dogs churches clues dishes Now create the driver program, Ask the user for their first and last name. Store the names in separate arrays. - Greet the user by their full names. Let them know what their initials are by calling the function in part 1. Ask them to input their favorite quote. Call function in part 2 to change the quote. Now call the function in line 3 and have the quote reversed. Finally, ask them to put in some nouns and pluralize each noun using the function in part 4. Continue evaluating nouns till the user inputs QUIT.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Knowledge Booster
Datatypes
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
  • SEE MORE 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