Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Create a function that takes a string and replaces every nth instance of oldChar with newchar. Your function will have four parameters: • str - The original input text to be processed. • nth - The nth instance to be replaced. • oldChar - The character being replaced. • newChar - The character replacing oldChar. In other words, if str is "abababa", nth is 3, oldChar is "a" and newChar is "Z", you would replace the 3rd insrtance of "a" with "Z", returning "ababZba". Examples replaceNth ("A glittering gem is not enough.", 0, "o", "-") → "A glittering gem is not enough." replaceNth ("Vader said: No, I am your father!", 2, "a", "o") "Vader soid: No, I am your fother!" replaceNth ("Writing a list of random sentences is harder than I initially though "Writing a list of random sentences 3s harder than I in3tially thought 3t wol Notes • If nth is 0, negative or larger than instances of oldChar, return the original string. • Tests are case sensitive.

Create a function that takes a string and replaces every nth instance of oldChar with newchar. Your function will have four parameters: • str - The original input text to be processed. • nth - The nth instance to be replaced. • oldChar - The character being replaced. • newChar - The character replacing oldChar. In other words, if str is "abababa", nth is 3, oldChar is "a" and newChar is "Z", you would replace the 3rd insrtance of "a" with "Z", returning "ababZba". Examples replaceNth ("A glittering gem is not enough.", 0, "o", "-") → "A glittering gem is not enough." replaceNth ("Vader said: No, I am your father!", 2, "a", "o") "Vader soid: No, I am your fother!" replaceNth ("Writing a list of random sentences is harder than I initially though "Writing a list of random sentences 3s harder than I in3tially thought 3t wol Notes • If nth is 0, negative or larger than instances of oldChar, return the original string. • Tests are case sensitive.

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

Answer the qust in the Java Script and use the opps concepts while answering the questions

Create a function that takes a string and replaces every nth instance of oldChar with newchar. Your function will have four parameters: • str - The original input text to be processed. • nth - The nth instance to be replaced. • oldChar - The character being replaced. • newChar - The character replacing oldChar In other words, if str is "abababa", nth is 3, oldChar is "a" and newChar is "Z", you would replace the 3rd insrtance of "a" with "Z", returning "ababZba". Examples replaceNth ("A glittering gem is not enough.", 0, "o", "-") → "A glittering gem is not enough." replaceNth ("Vader said: No, I am your father!", 2, "a", "o") "Vader soid: No, I am your fother!" replaceNth ("Writing a list of random sentences is harder than I initially though "Writing a list of random sentences 3s harder than I in3tially thought 3t wol - Notes • If nth is 0, negative or larger than instances of oldChar, return the original string. • Tests are case sensitive.
Transcribed Image Text:Create a function that takes a string and replaces every nth instance of oldChar with newchar. Your function will have four parameters: • str - The original input text to be processed. • nth - The nth instance to be replaced. • oldChar - The character being replaced. • newChar - The character replacing oldChar In other words, if str is "abababa", nth is 3, oldChar is "a" and newChar is "Z", you would replace the 3rd insrtance of "a" with "Z", returning "ababZba". Examples replaceNth ("A glittering gem is not enough.", 0, "o", "-") → "A glittering gem is not enough." replaceNth ("Vader said: No, I am your father!", 2, "a", "o") "Vader soid: No, I am your fother!" replaceNth ("Writing a list of random sentences is harder than I initially though "Writing a list of random sentences 3s harder than I in3tially thought 3t wol - Notes • If nth is 0, negative or larger than instances of oldChar, return the original string. • Tests are case sensitive.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
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.
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