C ++Lab Cross OutWrite a program that will ask for a sentence and letters to cross out. It should then print the sentence with the given letters changed to ‘X’ and it should say how many letters were crossed out. It should work regardless of case. Lab 2.5mo Cross OutWrite a program that will ask for a sentence and letters to cross out. It should then print thesentence with the given letters changed to 'X' and it should say how many letters were crossedout. It should work regardless of case.Enter a string: The quick brown fox jumped over the lazy dogs.Enter letters to cross out: aelOuHere you go: ThX qXXck brXwn fXx jXmpXd XvXr thX IXzy dXgs.There were 12 letters crossed out.Hints:Write a function that can cross out one letter (char) in a sentenceWrite a function that can count one letter (char) in a sentenceget it working with just crossing out one letter first.Test 1-3 should give just a letter to cross out..Then get it working with multiple letters.Write helper functions to cross out any letter (string) from a sentence.Test 4 will check for that. 5.6 string crossoutchar(string s, char x) {string r = "";for (unsigned int i-0; i

The question is to write C++ code for the given problem.

Write a program that will ask for a sentence and letters to cross out. It should then print the sentence with the given letters changed to ‘X’ and it should say how many letters were crossed out. It should work regardless of case.

Write a program that will ask for a sentence and letters to cross out. It should then print the sentence with the given letters changed to ‘X’ and it should say how many letters were crossed out. It should work regardless of case.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter7: Characters, Strings, And The Stringbuilder

Section: Chapter Questions

Problem 12RQ

See similar textbooks

Similar questions

Palindromes - “A palindrome” is a string that reads the same from both directions. For example: the word "mom" is a palindrome. Also, the string "Murder for a jar of red rum" is a palindrome. - So, you need to implement a Boolean function that takes as input a string and its return is true (1) in case the string is a palindrome and false (0) otherwise. - There are many ways to detect if a phrase is a palindrome. The method that you will implement in this task is by using two stacks. This works as follows. Push the left half of the characters to one stack (from left to right) and push the second half of the characters (from right to left) to another stack. Pop from both stacks and return false if at any time the two popped characters are different. Otherwise, you return true after comparing all the elements. Phrases of odd length have to be treated by skipping the middle element like the word "mom", your halves are "m" and "m". - Hint: (without using STL)
public static String pancakeScramble(String text) This nifty little problem is taken from the excellent Wolfram Challenges problem site where you can also see examples of what the result should be for various arguments. Given a text string, construct a new string by reversing its first two characters, then reversing the first three characters of that, and so on, until the last round where you reverse your entire current string
java program Write code that accomplishes the following tasks. Consider two bags that can hold strings. One bag is named letters and contain seeral one-letter strings. The other bag is empty and is namedvowels. One at a time removed a string from letters. If the string contain a vowel place it into bag vowels, otherwise, discard the string. After you have checked all of the strings in letters, report the number of vowels and the number of times each voewl appears in the bag.
Write a program that reads a string and checks the longest substring starting with "a" and ending with "z" included in it. Note that, the substring cannot contain another a or another z in it. For example: Ifs="bcd bbccdd badefgze tabdz", the longest substring is: 6
Write a program that gets a string from the user and maps the capital letters into small letters, and maps the small letters into capital letters. Namely, 'A' should be changed to 'a'; 'B' should be changed to 'b'; ... 'Z' should be changed to 'z'. Similarly, 'a' should be changed to 'A'; 'b' should be changed to 'B'; etc... Your program should also change the digits into next odd number. Namely, '0' should be changed to '1'; '1' should be leaved as '1'; '2' should be changed to '3'; ... '9' should be leaved as '9'. Your program should print the final form of the altered string. Example: If the user enters: My salary is 1000 TL. The output should be: mY SALARY IS 1111 tl.
write a program that inputs a string and checks if it is a palindrome. Use a functiion.****
Using Javascript and HTML: An interesting application of computers is drawing graphs and bar charts (sometimes called histograms). Write a script that reads five numbers between 1 and 30. For each number read, output HTML5 text that displays a line containing the same number of adjacent asterisks. For example, if your program reads the number 5, it should out HTML5 test that displays *****.
Q4: Colouring Book Having spent the last couple of hours grading assignments, I decide it’s time for a break. I take out my favourite colouring book, turn to a random page I haven’t coloured in yet, and lay it on my desk. I then take out all my n crayons and line them up on the desk (it’s a very long desk). The colour of the ith crayon is a string c[i] (e.g. "blue"). Many of the crayons have the same colour. In fact, no matter how many crayons I have, there are at most 30 distinct colours amongst them. To start colouring, I always take a sublist (see Q1 for a definition) of the crayons laid on the desk and put away the rest (too many options can be overwhelming and can lead to indecision). I take a look at the line art in front of me and wonder, “How many different colours do I need to make this look great? One? Two? Maybe three?”. Now you understand my dilemma and are fully aware of my indecision. You kindly decide to help me out by telling me for every number k, if I were to use…
DescriptionA researcher is analyzing DNA. A DNA can be represented as a string composed of the characters A, G, C, or T.One day, researchers found a strange DNA, which is Smooth Repeated DNA. The DNA is represented by a string that has infinite length. The string has a repeating pattern, i.e. the DNA string 0 is repeated an infinite number of times. For example, if0 = "????", then = "???????????? . . . ".According to researchers, a DNA is said to be special if it contains substrings . Determine whetheris a substring of . Squad FormatA line containing the two strings 0 and . Output FormatA line that determines whether it is a substring of . Issue “YES” ifis a substring of . Output “NO” otherwise. Example Input and Output Input Example Example Output AGCT GC YES AGCT TA YES AGCT GT No AGCT TAGCTAGCT YES AGGACCTA CTAA YES Explanation ExampleIn the first to fourth test case examples, is worth "???????????? . . . ". The part in bold is one of the…
Q_4.*. A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forward and backward. Alphanumeric characters include letters and numbers. Given a string s, return true if it is a palindrome, or false otherwise. Example 1: Input: s = "A man, a plan, a canal: Panama" Output: true Explanation: "amanaplanacanalpanama" is a palindrome. Example 2: Input: s = "race a car" Output: false Explanation: "raceacar" is not a palindrome..
Lab Task 04: Include the methods in the file KMP_Implementation.txt in a complete Java program that prompts for and reads a text string and then a text pattern to search for in the text. It then displays the result of the search. Sample program runs: Enter the text: ABABСАВАВАВСАВАВСАВАВСАВАВКККАВАВСАВАВ Enter the pattern to search for: ABABCABAB Pattern found at these text starting indexes: 0 Enter the text: A KFUPM STUDENT Enter the pattern to search for: KFE Pattern not in text. 7 12 17 29
Write a function that finds the number of occurrences of a specified character in a string using the following header:def count(s, ch):The str class has the count method. Implement your method without using the count method. For example, count("Welcome", 'e') returns 2. Write a test program that prompts the user to enter a string followed by a character and displays the number of occurrences of the character in the string.