“replaceSubstring” Function Program plan: Include the required header files to the program. Declare function prototype which is used in the program. Define the “main()” function. Declare the required variables. Get the input strings from the user and call the function “repalceSubstring” with the input strings. Print the result. Define the “repalceSubstring” function. Check the second and third strings, if both the strings are equal return null. Find the first occurrence of the second string in the first string and store in the variable. Replace that word with the third string. Find the next occurrence of the string and replace.

Question

Want to see the full answer?

Answer 1

Question

Chapter 12, Problem 8PC

Program Plan Intro

“replaceSubstring” Function

Program plan:

Include the required header files to the program.

Declare function prototype which is used in the program.

Define the “main()” function.

Declare the required variables.

Get the input strings from the user and call the function “repalceSubstring” with the input strings.

Print the result.

Define the “repalceSubstring” function.

Check the second and third strings, if both the strings are equal return null.

Find the first occurrence of the second string in the first string and store in the variable.

Replace that word with the third string.

Find the next occurrence of the string and replace.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

(1 point) By dragging statements from the left column to the right column below, give a proof by induction of the following statement: an = = 9" - 1 is a solution to the recurrence relation an = 9an-18 with ao = : 0. The correct proof will use 8 of the statements below. Statements to choose from: Note that a₁ = 9a0 + 8. Now assume that P(n) is true for all n ≥ 0. Your Proof: Put chosen statements in order in this column and press the Submit Answers button. Let P(n) be the predicate, "a = 9″ – 1". απ = 90 − 1 = Note that Let P(n) be the predicate, "an 9" - 1 is a solution to the recurrence relation an = 9an-1 +8 with ao = 0." - Now assume that P(k + 1) is true. Thus P(k) is true for all k. Thus P(k+1) is true. Then ak+1 = 9ak +8, so P(k + 1) is true. = 1 − 1 = 0, as required. Then = 9k — 1. ak Now assume that P(k) is true for an arbitrary integer k ≥ 1. By the recurrence relation, we have ak+1 = ak+1 = = 9ak + 8 = 9(9k − 1) + 8 This simplifies to 9k+19+8 = 9k+1 − 1 Then 9k+1 − 1 = 9(9*…

Given the following request to an AI chatbot, which response is more accurate? (You should use Google to verify that the factual claims in each response are accurate.) Prompt Is this true? The first recorded use of the phrase "when pigs fly" in print is in a 1616 play by Ben Jonson called "The Devil is an Ass," in which a character says, "When pigs fly, good-night!!" Response Response A Response B Yes, that's true! The phrase "when pigs fly" indeed appears in Ben Jonson's 1616 play The Devil is an Ass and was said during the second act in a conversation between Fitzdottrel and Pug. The phrase was first used to express skepticism or disbelief, suggesting that something is as unlikely to happen as the fanciful idea of pigs flying. This usage is often cited as one of the earliest instances of the phrase in print. The claim that the phrase "when pigs fly" was first recorded in Ben Jonson's 1616 play "The Devil is an Ass" is not accurate. There is no evidence from the…

This is for my Computer Organization & Assembly Language Class