Write a function that determines if two strings are anagrams. The function should not be case sensitive and should disregard any punctuation or spaces. Two strings are anagrams if the letters can be rearranged to form each other. For example, “Eleven plus two” is an anagram of “Twelve plus one”. Each string contains one “v”, three “e’s”, two “l’s”, etc. Test your function with several strings that are anagrams and non-anagrams. You may use either the string class or a C-style string. use c++

Write a function that determines if two strings are anagrams. The function should not be case sensitive and should disregard any punctuation or spaces. Two strings are anagrams if the letters can be rearranged to form each other. For example, “Eleven plus two” is an anagram of “Twelve plus one”. Each string contains one “v”, three “e’s”, two “l’s”, etc. Test your function with several strings that are anagrams and non-anagrams. You may use either the string class or a C-style string. use c++

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter6: User-defined Functions

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

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!
Create a function that takes a string with at least one sentence in it and returns a string with the part(s) after the comma at the beginning of the sentence(s). Examples reverse LegoYoda ("Hit you with my stick, I shall.") ➡ "I shall hit you with my stick." reverse LegoYoda ("Rejected me, my crush has. Ketamine, I need.") "My crush has rejected me. I need ketamine." - reverseLegoYoda ("An alien, I am. Holding me captive in Area 51, the government : → "I am an alien. The government is holding me captive in Area 51."
: Given a string, write a function to check if it is a permutation ofa palindrome. A palindrome is a word or phrase that is the same forwards and backwards. Apermutation is a rearrangement of letters. The palindrome does not need to be limited to justdictionary words.EXAMPLEInput: Tact CoaOutput: True (permutations: "taco cat'; "atco eta·; etc.)
Write a function that takes two integers and returns True if the integers have a common divisor that is different than 1, otherwise returns False. For example, notRelPrime(3,5) returns False, whereas notRelPrime (8,12) returns True. Because, 3 and 5 have only one common divisor, which is 1, whereas 8 and 12 are both divisible by 1, 2 and 4. def notRelPrime (a, b):
Complete the count_consonants () function that takes a single string parameter - text. This function counts and returns the number of consonants in the text. A consonant is an alphabetical character that is not a vowel (i.e., an alphabetical character that is not an "a", "e", "i", "o" or "u"). The function must be able to count consonants regardless of case. Some examples of the function being called are shown below. Note: • You may find the isalpha () and lower () string methods useful for this exercise. • Please only provide the function definition. For example: Test text"Hello World" print("Number of consonants ", count_consonants (text)) text "A quick brown fox" print("Number of consonants", count_consonants (text)) Result Number of consonants = 7 Number of consonants - 9
Two words are anagrams if they are formed by rearranging the letters of another, such as cinema, formed from iceman, and vice versa. Implement an anagram checker function using string functions in C. Your program should be able to: 1. Scan for the two words to be checked 2. Pass those two words to a function called areAnagrams which returns an int to be interpreted in the main() whether the given words are anagrams or not. 3. The program should loop indefinitely until the words "EXIT NOW" is used as input. Sample Run: Enter two strings: cinema iceman cinema and iceman are anagrams! Enter two strings: almost atoms almost and atoms are NOT anagrams Enter two strings: vice versa vice and versa are NOT anagrams! Enter two strings: frail flare frail and flare are NOT anagrams! Enter two strings: algorithm logarithm algorithm and logarithm are anagrams! Enter two strings: EXIT NOW
please code in python Write a function that receives a string as an input and returns the most frequent letter from the given string. Your solution should be case insensitive, so a capital letter (like A) and its non-capital version (a) should be counted as the same letter. In the given string there can be spaces as well, but your solution shouldn’t count spaces. If there are multiple letters with the same occurrence, you can decide which one to return.
Create a function that determines whether a number is Oddish or Evenish. A number is Oddish if the sum of all of its digits is odd, and a number is Evenish if the sum of all of its digits is even. If a number is Oddish, return "Oddish". Otherwise, return "Evenish" For example, oddishOr Evenish (121) should return "Evenish", since 1 + 2 + 1 = 4. oddishorEvenish (41) should return "Oddish", since 4 + 1 = 5. Examples oddishOr Evenish (43) → "Oddish" // 4 + 3 = 7 // 7 % 2 = 1 oddishorEvenish (373) // 3 + 7 + 3 = 13 // 13 % 2 = 1 → "Oddish" oddishOr Evenish (4433) → "Evenish" // 4 + 4 + 3 + 3 = 14 // 14 % 2 = 0
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.
Create a function that determines whether a string is a valid hex code. A hex code must begin with a pound key # and is exactly 6 characters in length. Each character must be a digit from 0-9 or an alphabetic character from A-F. All alphabetic characters may be uppercase or lowercase. Examples isValidHexCode ("#CD5C5C") → true isValidHexCode("#EAECEE") → true isValidHexCode ("#eaecee") → true isValid HexCode ("#CD5C58C") → false // Length exceeds 6
Write a function that takes two integers and returns True if the integers have a common divisor that is different than 1, otherwise returns False. For example, notRelPrime(3,5) returns False, whereas notRelPrime(8,12) returnsTrue. Because, 3 and 5 have only one common divisor, which is 1, whereas 8 and 12 are both divisible by 1, 2 and 4.
7. Write a Boolean function called contains_whitespace() that accepts a string as a parameter and returns True is the string contains one or more whitespaces (“ ", “/t", “/n") characters, or False otherwise. Write a main() function to demonstrate how it works.