Solve the problem in C++ (Anagrams) Write a function that checks whether two words are anagrams. Two words are anagrams if they contain the same letters in any order. For example, “silent” and “listen” are anagrams. The header of the function is as follows: bool isAnagram(const string& s1, const string& s2) Write a test program that prompts the user to enter two strings and checks whether they are anagrams. Sample Run 1 Enter a string s1: silent Enter a string s2: listen silent and listen are anagrams

Solve the problem in C++ (Anagrams) Write a function that checks whether two words are anagrams. Two words are anagrams if they contain the same letters in any order. For example, “silent” and “listen” are anagrams. The header of the function is as follows: bool isAnagram(const string& s1, const string& s2) Write a test program that prompts the user to enter two strings and checks whether they are anagrams. Sample Run 1 Enter a string s1: silent Enter a string s2: listen silent and listen are anagrams

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

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…
In C++ Write a recursive function that displays a string reversely on the console using the following header:void reverseDisplay(const string& s) For example, reverseDisplay("abcd") displays dcba. Write a test programthat prompts the user to enter a string and displays its reversal.
1. Write a recursive function that takes a string as an input and returns the reverse of the string. 2.Write a recursive function rec_string that produces the output shown below for the corresponding function calls. Write a main function to test the function. Method call rec_string(‘abcde’), will produce the following output: *ede cde bcde abcde Method call rec_string(‘abc’), will produce the following output: *cbc abc 3. Write a recursive function for Euclid's algorithm to find the greatest common divisor (gcd) of two positive integers. gcd is the largest integer that divides evenly into both of them. For example, the gcd(102, 68) = 34. You may recall learning about the greatest common divisor when you learned to reduce fractions. For example, we can simplify 68/102 to 2/3 by dividing both numerator and denominator by 34, their gcd. Finding the gcd of huge numbers is an important problem that arises in many commercial applications. We can efficiently compute the gcd using the…
C++ : Write a function that has three C++ strings as parameters. It searches the first parameter to find the secondparameter (as a substring) and replaces it with the third parameter. It returns the changed first parameter if the substringcan be found; otherwise, it returns the original first parameter. Test your function in a program.
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,…
Write a function that prompts the user to input a sentence. Then checks the sentence to make sure the following rules have been followed: • the entire first word of the sentence should be capitalized • the sentence ends with a punctuation mark (any) If the sentence meets these requirements, print and return the string RULES CONFIRMED (exactly as shown). If the sentence does NOT meet the requirements, the function should fix the sentence such that it will pass the rules, print the type of error(s) and then return the fixed sentence. Examples Examples of function being called fixer ("THIS is a test?") Example of function output RULES CONFIRMED ERROR: First word is not translate ("this is capitalized a test") ERROR: Missing ending punctuation mark translate ("THIS is ERROR: Missing ending a test") punctuation mark translate ("This is First word is not a test!") capitalized Example of string returned by function RULES CONFIRMED THIS is a test. THIS is a test! THIS is a test!
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…
on c++ Question 01: Write a recursive function that converts a decimal number into a binary number as a string. The function header is: string decimalToBinary(int value) Write a test program that prompts the user to enter a decimal number and displays its binary equivalent. Question 02: Write a recursive function that parses a binary number as a string into a decimal integer. The function header is: int binaryToDecimal(const string& binaryString) Write a test program that prompts the user to enter a binary string and displays its decimal equivalent.
Write a recursive function to return the total number of space characters in a string. You need to define the following two functions. The second one is a recursive helper function. int numberOfSpaces(const string& s) int numberOfSpaces(const string& s, int i) Write a test program that prompts the user to enter a string, invokes the function, and displays the number of spaces in the string.
Problem: Write a C++ program that would implement the function called filterString which accepts a string s that contains numbers and letters mixed up. The function must return an integer corresponding to the numbers in s in the order that they appear. If there are no numbers in s, the function should return 0. TEST CASES: filterString(‘123’) = 123 filterString(‘abc’’) = 0 filterString(‘aa 112 3dd’) = 1123 ASSUMPTIONS Assume that all the inputs are strings (no need for try-catch method)
on c++ these to q are related to each Question 01: Write a recursive function that converts a decimal number into a binary number as a string. The function header is: string decimalToBinary(int value) Write a test program that prompts the user to enter a decimal number and displays its binary equivalent. Question 02: Write a recursive function that parses a binary number as a string into a decimal integer. The function header is: int binaryToDecimal(const string& binaryString) Write a test program that prompts the user to enter a binary string and displays its decimal equivalent.
LISP Function help please A function that generates a random day of the week, then displays a message saying that "Today is ... and tomorrow will be ...". Then use the built-in function random first to generate a number between 0 and 6 (including). The expression (random) by itself generates a random integer. You can call it with one parameter to return a value within the range from 0 to the value of the parameter-1. For example, (random 10) will return a value between 0 and 9. Next, use the number generated at the previous step to retrieve the symbol for the day of the week from the list. Use the built-in elt. Extract the symbol-name of the day first, then apply the built-in function capitalize to it. Use the result in the princ function call, and do the same thing for the next day. Make the function return true (t) instead of the last thing it evaluates, to avoid seeing the message printed more than once.