EMOTICON PROBLEM: Create a function that changes specific words into emoticons. Given a sentence as a string, replace the words smile, grin, sad and mad with their corresponding emoticon: word Smile Grin Sad Mad emoticon :) :D :(( >:( Example: - emotify("Make me smile") → Make me :) emotify("I am mad") → I am >:(

EMOTICON PROBLEM: Create a function that changes specific words into emoticons. Given a sentence as a string, replace the words smile, grin, sad and mad with their corresponding emoticon: word Smile Grin Sad Mad emoticon :) :D :(( >:( Example: - emotify("Make me smile") → Make me :) emotify("I am mad") → I am >:(

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

vowelIndex Write a function vowelIndex that accepts a word (a str) as an argument and returns the index of the first vowel in the word. If there is no vowel, -1 is returned. For this problem, both upper and lower case vowels count, and 'y' is not considered to be a vowel. Sample usage: >>> vowelIndex('hello') 1 >>> vowelIndex('string') 3 >>> vowelIndex('string') 3 >>> vowelIndex('BUY') 1 >>> vowelIndex('APPLE') 0 >>> vowelIndex('nymphly') -1 >>> vowelIndex('string')==3 True >>> vowel Index ('nymphly')==-1 True
Instructions: In the code editor, you are provided with a main() function that asks the user for a string and passes this string and the size of this string to a function call of the function, preserveString(). This preserveString() function has the following description: Return type - void Name - preserveString Parameters The string Length of the string Description - this is a recursive function that prints the string repeatedly. Each time it prints the string, it excludes the last character of the string until only one character is left. This preserveString() function has already been partially implemented. Your only task is to add the recursive case of this function. Please Finish the code ASAP: This is my current given code: #include<stdio.h>#include<string.h> #define STR_MAX_SIZE 100 void preserveString(char*, int); int main(void) { char str[STR_MAX_SIZE]; printf("Enter string: "); fgets(str, STR_MAX_SIZE, stdin); preserveString(str,…
Exercise Objectives Problem Description Write a program that reads a string and mirrors it around the middle character. Examples: abcd becomes cdab. abcde becomes deCab AhmadAlami becomes AlamiAhmad Page 1 of 2 Your program must: • Implement function void reflect (char* str) which receives a string (array of characters) and mirrors it. This function does not print anything. • Read from the user (in main()) a string and then print the string after calling function reflect(). • Use pointers and pointer arithmetic only. The use of array notation and/or functions from the string.h library is not allowed.
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…
isset(); is a ------ function. O a Integer O b. None O . Boolean O d. String
palindromes Write a function palindromes that accepts a sentence as an argument. The function then returns a list of all words in the sentence that are palindromes, that is they are the same forwards and backwards. Guidelines: • punctuation characters .,;!? should be ignored • the palindrome check should not depend on case Sample usage: >>> palindromes ("Hey Anna, would you prefer to ride in a kayak or a racecar?") ['Anna', 'a', 'kayak', 'a', 'racecar'] >>> palindromes ("Able was I ere I saw Elba.") ['I', 'ere', 'I'] >>> palindromes ("Otto, go see Tacocat at the Civic Center, their guitar solos are Wow!") ['Otto', 'Tacocat', 'Civic', 'solos', 'wow'] >>> palindromes ("Otto, go see Tacocat at the Civic Center, their guitar solos are wow!")==['Otto', 'Tacocat', 'Civic', 'solos', 'wow'] True
Objective: string and character manipulation, string.h and ctype.h libraries For each of the problems, create a user-defined function. Then write a driver program for the functions inside the main. 1- Write a function that takes a word less than 25 characters long and returns the letter that word starts with (in capital letters). 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 (*). 3- Write a function that takes as input one line and reverses the words of the line 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”. 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…
4. Complete the function show_upper. This function takes one parameter - a string (s). It should return a string made up of all the upper-case characters in s. For example, if s is “aBdDEfgHijK” then show_upper should return “BDEHK”. It should return the upper-case string - not print it. Do not change anything outside show_upper.
Problem DNA: Subsequence markingA common task in dealing with DNA sequences is searching for particular substrings within longer DNA sequences. Write a function mark_dna that takes as parameters a DNA sequence to search, and a shorter target sequence to find within the longer sequence. Have this function return a new altered sequence that is the original sequence with all non-overlapping occurrences of the target surrounded with the characters >> and <<. Hints: ● String slicing is useful for looking at multiple characters at once. ● Remember that you cannot modify the original string directly, you’ll need to build a copy. Start with an empty string and concatenate onto it as you loop. Constraints: ● Don't use the built-in replace string method. All other string methods are permitted. >>> mark_dna('atgcgctagcatg', 'gcg') 'at>>gcg<<ctagcatg' >>> mark_dna('atgcgctagcatg', 'gc')…
PYTHON CS1 PROBLEM (NO LOOPS) Define a recursive function that takes two strings str1 and str2 as parameters. It returns True if str1 is a suffix of str2, otherwise it should return False.For example: If str1 = True. If str1 = False. If str1 = If str1 = If str1 = If str1 = “washer” and str2 = “dishwasher” then your function should return “wash” and str2 = “dishwasher” then your function should return “” and str2 = “test” then your function should return True. “test” and str2 = “” then your function should return False.“” and str2 = “” then your function should return True.“test” and str2 = “test” then your function should return True.
Exercise 1: Word Separator Write a program that accepts as input a sentence in which all of the words are run together, but the first character of each word is uppercase. Convert the sentence to a string in which the words are separated by spaces and only the first word starts with an uppercase letter. For example the string StopAndSmellTheRoses. would be converted to “Stop and smell the roses.” Exercise 2: replaceSubstring Function Write a function named replaceSubstring. The function should accept three string object arguments. Let’s call them string1, string2, and string3. It should search string1 for all occurrences of string2. When it finds an occurrence of string2, it should replace it with string3. For example, suppose the three arguments have the following values: string1: “the dog jumped over the fence” string2: “the” string3: “that” With these three arguments, the function would return a string object with the value “that dog jumped over that fence.” Demonstrate the…
Problem: Substring Pattern Matching Input: A text string t and a pattern string p Output: Does t contain the pattern p as a substring, and if so, where? For example: with t= abaababbaba, p = abba, your function should return 5. int findmatch(char *p, char *t) { int plen = strlen(p); // len of string int tlen = strlen(t); // len of string t //TODO: your code } Analyze your algorithm: what is the big O?