estion 42: Return whether a string consists of a single letter In the function below, return True if the input string parameter consists of a single uppercase letter; otherwise, return False. Most solutions would do this in two logical steps: first testing if the string consists of a single character and, second, testing whether that charact

estion 42: Return whether a string consists of a single letter In the function below, return True if the input string parameter consists of a single uppercase letter; otherwise, return False. Most solutions would do this in two logical steps: first testing if the string consists of a single character and, second, testing whether that charact

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

Create a function which replaces all the x's in the string in the following ways: Replace all x's with "cks" UNLESS: The word begins with "x", therefore replace it with "z". The word is just the letter "x", therefore replace it with "ecks". Examples xPronounce ("Inside the box was a xylophone") → "Inside the bocks was a zylophone" xPronounce ("The x ray is excellent") "The ecks ray is eckscellent" xPronounce ("OMG x box unboxing video x D") → "OMG ecks bocks unbocksing video ecks D"
Create a function which replaces all the x's in the string in the following ways: Replace all x's with "cks" UNLESS: The word begins with "x", therefore replace it with "z". The word is just the letter "x", therefore replace it with "ecks". Examples xPronounce("Inside the box was a xylophone") → "Inside the bocks was a zylophone" xPronounce ("The x ray is excellent") → "The ecks ray is eckscellent" xPronounce ("OMG x box unboxing video x D") ➡ "OMG ecks bocks unbocksing video ecks D" Solve with Java Script
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.
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 which replaces all the x's in the string in the following ways: 1. Replace all x's with "cks" UNLESS: 2. The word begins with "x", therefore replace it with "z". 3. The word is just the letter "x", therefore replace it with "ecks". Examples xPronounce("Inside the box was a xylophone") → "Inside the bocks was a zylophone" xPronounce ("The x ray is excellent") "The ecks ray is eckscellent" xPronounce ("OMG x box unboxing video x D") → "OMG ecks bocks unbocksing video ecks D"
Complete the check_strings_same_start(word1, word2) function which is passed two string parameters. The function returns True if the two parameter strings start with the same character and only one (not both) of the parameter strings has an even number of characters (including any space characters), otherwise the function returns False. For example: Test Result result = check_strings_same_start("blue", "bag") True print(result) print(check_strings_same_start("babyproofing", "baby")) False print(check_strings_same_start("check", "fact")) False
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 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."
Write a function that finds the number of occurrences of a specified character in the string using the following header: int count(const string& s, char a) For example, count("Welcome", 'e') returns 2. Write a test program that reads a string and a character and displays the number of occurrences of the char- acter in the string.
Create a function that takes a string of words and returns the word with the highest score. Each letter of the word gets points according to its position in the alphabet: a = 1, b = 2, C = 3, etc. Examples wordRank ("A quick brown fox.") → "brown" wordRank ("Nancy is very pretty.") "pretty" wordRank ("Come back tomorrow, man!") → "tomorrow" wordRank ("Wednesday is hump day.") "Wednesday" Solution in JS 10
please code in python Write a function that receives a string and a number (n) as parameters and returns a new string that contains only every nth letter from the given string. print(everyNth('banana', 2)) # should return aaaprint(everyNth('carrot', 3)) # should return rtprint(everyNth('pear', 1)) # should return pear
Write a function is_mirror(s) that takes as input a string s and returns True if s is a mirrored string (i.e., a string that could have been produced by your mirror function) and False otherwise. Examples:>>> is_mirror('baconnocab')True>>> print(is_mirror('baconnoca'))False