Specification: Read sentences from the user until * is entered. Show the number of words in each sentence that contain a stretch of non-z characters with exactly 2 vowels. A stretch starts from the start of the word or after a 'z'. A stretch terminates just before another 'z' or at the end of the word. Examples: 1. Matching words: zoo, azozooza, GONZALEZ 2. Non-matching words: ozo, azoooza The sentences contain no punctuation, the words are separated by one or more spaces, and the characters may be upper or lower case. Keep reading sentences until the user enters "*". Sample I/O: Sentence: azoooza azooza zoo azoo Matching words = 3 Sentence: GONZALEZ passes the ball to VAZQUEZ Matching words = 3 Sentence: azozototzeti Matching words = 1 Sentence: * Done

Specification: Read sentences from the user until * is entered. Show the number of words in each sentence that contain a stretch of non-z characters with exactly 2 vowels. A stretch starts from the start of the word or after a 'z'. A stretch terminates just before another 'z' or at the end of the word. Examples: 1. Matching words: zoo, azozooza, GONZALEZ 2. Non-matching words: ozo, azoooza The sentences contain no punctuation, the words are separated by one or more spaces, and the characters may be upper or lower case. Keep reading sentences until the user enters "". Sample I/O: Sentence: azoooza azooza zoo azoo Matching words = 3 Sentence: GONZALEZ passes the ball to VAZQUEZ Matching words = 3 Sentence: azozototzeti Matching words = 1 Sentence: Done

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter7: User-defined Simple Data Types, Namespaces, And The String Type

Section: Chapter Questions

Problem 3PE

See similar textbooks

Similar questions

StretchWith2Vowels Specification: Read sentences from the user until * is entered. Show the number of words in each sentence that contain a stretch of non-z characters with exactly 2 vowels. A stretch starts from the start of the word or after a 'z'. A stretch terminates just before another 'z' or at the end of the word. Examples: 1. Matching words: zoo, azozooza, GONZALEZ 2. Non-matching words: ozo, azoooza The sentences contain no punctuation, the words are separated by one or more spaces, and the characters may be upper or lower case. Keep reading sentences until the user enters "*". Sample I/O: Sentence: azoooza azooza zoo azo0 Matching words = 3 Sentence: GONZALEZ passes the ball to VAZQUEZ Matching words = 3 Sentence: azozototzeti Matching words = 1 Sentence: * Done
CODING LANGUAGE: R (similar to python) R is a programming language for statistical computing and graphics supported by the R Core Team and the R Foundation for Statistical Computing. The Behdel TestThe Bechdel test asks whether a work of fiction features at least two women who talk to each otherabout something other than a man, and there must be two women named characters.In this mini analysis we work with the data used in the FiveThirtyEight story titled:"The Dollar-And-Cents Case Against Hollywood's Exclusion of Women"https://fivethirtyeight.com/features/the-dollar-and-cents-case-against-hollywoods-exclusion-of-women/Start with loading the packages: fivethirtyeight, tidyverse1. What information does this dataset contain? What commands did you use to see this?For our purposes of analysis we will focus our analysis on movies released between 1990 and 2013.bechdel90_13 <- bechdel %>%filter(between(year, 1990, 2013))2. How many movies are in our filtered data set?The…
Treasure Hunter description You are in front of a cave that has treasures. The cave canrepresented in a grid which has rows numbered from 1to , and of the columns numbered from 1 to . For this problem, define (?, )is the tile that is in the -th row and -column.There is a character in each tile, which indicates the type of that tile.Tiles can be floors, walls, or treasures that are sequentially representedwith the characters '.' (period), '#' (hashmark), and '*' (asterisk). You can passfloor and treasure tiles, but can't get past wall tiles.Initially, you are in a tile (??, ). You want to visit all the treasure squares, andtake the treasure. If you visit the treasure chest, then treasurewill be instantly taken, then the tile turns into a floor.In a move, if you are in a tile (?, ), then you can move tosquares immediately above (? 1, ), right (?, + 1), bottom (? + 1, ), and left (?, 1) of thecurrent plot. The tile you visit must not be off the grid, and must not be awall patch.Determine…
Ancay youyay eakspay igpay atinlay? (Can you speak pig latin?) If you can’t, here are the rules: If a word begins with a consonant, take all of the letters before the first vowel and move them to the end of the word, then add ay to the end of the word. Examples: pig → igpay, there → erethay. If a word begins with a vowel (a, e, i, o, u, or y), simply add yay to the end of the word. For this problem, y is always a vowel. Examples: and → andyay, ordinary → ordinaryyay. Although there are many variants of Pig Latin (such as Kedelkloppersprook in Germany), for this problem we will always use the rules described above. A friend of yours was frustrated with everyone writing in Pig Latin and has asked you to write a program to translate to Pig Latin for him. Ouldway youyay ebay osay indkay otay oday ityay? (Would you be so kind to do it?) Inputs consist of lines of text that you will individually translate from a text file given by the user. If the file cannot be opened for some reason,…
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…
Incorrect Question 3 Consider: String s1 = "a"; What is the difference between: (A) String s2 And: (B) = s1; String s2 = new String(s1); (B) assigns a reference to the original "a" to s2 (B) is not allowed O (A) assigns a reference to the original "a" to s2 No difference
Alphabetic Telephone Number TranslatorMany companies use telephone numbers like 555-GET-FOOD so the number is easier for theircustomers to remember. On a standard telephone, the alphabetic letters are mapped to numbers519in the following fashion:A, B, and C = 2D, E, and F = 3G, H, and I = 4J, K, and L = 5M, N, and O = 6P, Q, R, and S = 7T, U, and V = 8W, X, Y, and Z = 9Write a program that asks the user to enter a 10-character telephone number in the format XXXXXX-XXXX. The application should display the telephone number with any alphabeticcharacters that appeared in the original translated to their numeric equivalent. For example, ifthe user enters 555-GET-FOOD, the application should display 555-438-3663 For the attached assignment, write a python program, you also need to write: Comments for all the values, constants, and functions IPO Variables Pseudcode
Data structure & Algorithum. 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 vowels appears in the bag.
s = "abab" h 55m Left Substrings in s are { 'a', 'b', 'a', 'b', 'ab', 'ba', 'ab', 'aba', 'bab', 'abab'}. By deleting one "a" and one "b", the string becomes "ab" or "ba" and all of its substrings are distinct. This required 17. String Reduction 2 deletions. Given a string, reduce it in such a way that all of its substrings are distinct. To do so, you may delete any characters at any ALL index. What is the minimum number of deletions needed? Function Description Complete the function getMinDeletions in the editor below. Note: A substring is a contiguous group of 1 or more characters within a string. getMinDeletions has the following parameter(s): Example string s: the given string 8 S = "abab" Returns: int: the minimum number of deletions required Substrings in s are { 'a', 'b', 'a', 'b', 'ab', 'ba', 'ab', 'aba', 'bab', 'abab'}. By deleting one "a" and one "b", the string becomes "ab" or "ba" and all of its substrings are distinct. This required Constraints 2 deletions. 10 1sns 105…
Asap
PLEASE CODE IN PYTHON The Penny Pitch game is popular in amusement parks. Pennies are tossed onto a board that has certain areas marked with different prizes. For example: The prizes available on this board are puzzle, game, ball, poster, and doll. At the end of the game, if all of the squares that say BALL are covered by a penny, the player gets the ball. This is also true for the other prizes. The board is made up of 25 squares (5 x 5). Each prize appears on three randomly chosen squares so that 15 squares contain prizes.In Python, create a PennyPitch application that displays a Penny Pitch board (use [ and ] to indicate squares) with prizes randomly placed and then simulates ten pennies being randomly pitched onto the board. After the pennies have been pitched, the application should display a message indicating which prizes have been won, if any.
9-13. Substring: Complete the following code to check if str2 with length strlen2 is a substring of str1 with length strlen1. Examples: str1=flower, str2=low (low is a substring of flower) str1=flower, str2=law (law is not a substring of flower) Algorithm: 1. Find the first character of str2 in str1. 2. If not found, str2 is not a substring of str1, else compare the remaining characters. 3. If all remaining characters matched, str2 is a substring of str1. Else, str2 is not a substring of strl. cld mov rcx, qword [strlenl] 9. 10. 11. cmp rcx, 0 je not Substring mov rcx, qword [strlen2] dec rcx 12. inc rsi 13. cmp rcx, 0 je substring jmp notSubstring