Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

In c#. (a) Write a function to determine if a given string str contains a substring subStr The function should return true if subStr appears

image text in transcribed

In c#.

(a) Write a function to determine if a given string str contains a substring subStr The function should return true if subStr appears anywhere inside str, false otherwise. int strContains (const char *str, const char *subStr); (b) Write a function that takes a string s and returns a new string that contains the first character of each word in s (you may assume that words are separated by a single space) but capitalized. For example, if we call this function with the string "International Business Machines" it should return "IBM" . If we call it with the string Flint Lockwood Diatonic Super Mutating Dynamic Food Replicator" it should return "FLDSMDFR" characronymizer(const char *s); (c) Write a function that replaces instances of a given character with a different char- acter in a string. void replaceChar (char *src, char oldChar, char newChar); Which will replace any instance of the character stored in oldChar with the char- acter stored in newChar in the string src d) Write a function that takes a string and removes all instances of a certain character from it. void removeChar (char *src, char c); When removing characters, all subsequent characters should be shifted down. Take care that you handle the null terminating character properly

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Databases Illuminated

Authors: Catherine M. Ricardo, Susan D. Urban, Karen C. Davis

4th Edition

1284231585, 978-1284231588

More Books

Students also viewed these Databases questions