i need J please 25. Write the strings if the value of m and n as stated below. Given examples of the first language.m=1, n=1m= 1, n=0m-0, n1m= 1, n=2m= 2, n=1a'b' = oobbo'b'- oba) (ab" |n2 0}b) (a"b" | m, n 0)c) (amb"c m, n2 0)d) (a"b"cm | m, n20)a'b' = aba'b' = abe) (a"b"c"d" | m, n2 0)f) (am"c" | m2 0)8) (a"b"c"d" | m, n2 0)h) (obe" | m, n20)i) (a"b"c" |m, n2 0)(a"bie | m, n2 0)k) (omb"c | m, n2 0)1)(a"b'c| m, n2 0)42IPage

Here below figure we find all the string:…

25. Write the strings if the value of m and n as stated below. Given examples of the first language. m-1, n1 m= 1, n=0 m-0, n1 m1, n=2 m= 2, n1 a) (a*b" | n2 0} b) (o"b | m, n2 0) c) (amb"cn m, n2 0) d) (a"bem | m, n2 0) e) (o"be"d" |m, n2 0) (amb"e" | m20) e) (a"b"c"d | m, n2 0) h) (obe" |m, n20) (a"b" | m, nz0) a'b' = ab a'b'= ab a'b' = oobb o'b'= ab f) )(a"b | m, n20) k) (ab"e | m, nz 0) (o"bc | m, n2 0)

25. Write the strings if the value of m and n as stated below. Given examples of the first language. m-1, n1 m= 1, n=0 m-0, n1 m1, n=2 m= 2, n1 a) (a*b" | n2 0} b) (o"b | m, n2 0) c) (amb"cn m, n2 0) d) (a"bem | m, n2 0) e) (o"be"d" |m, n2 0) (amb"e" | m20) e) (a"b"c"d | m, n2 0) h) (obe" |m, n20) (a"b" | m, nz0) a'b' = ab a'b'= ab a'b' = oobb o'b'= ab f) )(a"b | m, n20) k) (ab"e | m, nz 0) (o"bc | m, n2 0)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 10PE

See similar textbooks

Similar questions

PLEASE US SCHEME IN DRRACKET: In the language of an alien race, all words take the form of Blurbs. A Blurb is a Whoozit followed by between zero or more Whatzits. A Whoozit is the character 'x' followed by between one or more 'y's. A Whatzit is a 'q' followed by either a 'z' or a 'd', followed by a Whoozit.-The program should ask the user to “Enter an alien word:”, read the input as a string, and check whether or not it is a valid word (Blurb). If it is valid, it prints "The word is fine.", otherwise it prints "The word is a mess!". -The program should loop and ask the user for new input until they enter a valid blurb.
The following two languages over {a,b} L1: All strings that contains at least two 'b's L2: All strings that has an 'a' as the second to last character of the string
Consider the following application. Identify and correct any syntactic errors or omissions by rewriting the line number and the corrected line. Note: There are 8 lines with errors. Each line may have multiple errors. Here’s an example (here, the error is on line 2, the correction is in bold – int x = 0;): 01 public static void main(String[] args){ 02 int x = '0'; 02 int x = 0; 03 int y + x = 7 03 int y = x + 7; 04 } 01 public Class Average; 02 { 03 public void main(String [] args) 04 { 05 double sc = (70, 75, 90, 83, 85, 97, 82, 79, 94, 87; 06 double me su = 0.0 07 for (int k = 0; k < sc.length(); k++); 08 su += sc[ ]; 09 double me = su/sc.length() 10 System.Out.printf("Output: %.2f" + me); 11 } 12 } What value of the variable me will be printed in line 10?
Write a program in c++ that can find a given letter within a word of more than 10 characters, entered by the user. The program must indicate the successive position(s) of the character and display the character(s) found in capital letters.Example:Enter a word greater than 10 characters: extraordinarySearch letter: aResult: extrAordinAryThe letter a appears in positions 5 and 11.
In C++, create a program which will read a phrase from the user and create a framed version of it for printing. For example, the phrase "hello world"would result in: ********* * hello * * world * ********* Whereas the phrase "the sky is falling"might be: *********** * the * * sky * * is * * falling * *********** Or: *********** * the * * sky * * is * * falling * *********** Or even: *********** * the * * sky * * is * * falling * *********** Depending on whether or not the user asked for left, centered, or right justification — respectively — of the phrase's words within the frame. Note how the frame exactly fits the phrase based on the longest word within. Neat, eh? The phrase "O | -+- | /-\"when centered would become: ******* * O * * | * * -+- * * | * * /-\ * ******* (Okay, so it's a sad excuse for a stick figure, but hey! I've never claimed to be a great good decent…
Number system is base 10, because it strings together the digits 0 – 9 to form any whole number (there is a 1’s place, a 10’s place, a 10-squared’s place, etc). Hexadecimal numbers are written in base 16. This means they string together the digits 0 – 9 and the letters A – F to form any whole number (there is a 1’s place, a 16’s place, a 16-squared’s place, etc). For example, BD3C8 and 305A2 are two different 5-digit hexadecimal numbers. How many 9-digit hexadecimal numbers are there that have exactly 4 zeroes. (Note: Hexadecimal numbers, like our normal base 10 numbers, cannot start with a 0).
In c++, Thank you Write a program that finds word differences between two sentences. The input begins with an integer indicating the number of words in each sentence. The next input line is the first sentence and the following input line is the second sentence. Assume that the two sentences have the same number of words and no more than 20 words each. The program displays word pairs that differ between the two sentences. One pair is displayed per line. Ex: If the input is: 6 Smaller cars get better gas mileage Tiny cars get great fuel economy then the output is: Smaller Tiny better great gas fuel mileage economy Add a function named ReadSentences to read the input sentences into two string vectors.void ReadSentences(vector<string>& sentence1Words, vector<string>& sentence2Words, int wordCount) main() already contains code to read the word count and call ReadSentences(). Complete main() to display differing word pairs.
Write a function secondIndexOf, taking two strings and determining the second occurrence of the second string in the first string. If the search string does not occur twice, -1 should be returned. Example: secondIndexOf('White Rabbit', 'it') should return 10.
In C++ write a program that prompts the user to enter three strings and then make a new string formed by concatenation of the three strings with space in between. Print the new string formed in output. Input- "Alpha", "Beta", "Gamma" Output- "Alpha Beta Gamma"
IN C++ PLEASE Write a program that reads integers, finds the largest of them, and counts its occurrences. Assume that the input ends with number 0. Suppose that you entered 3 5 2 5 5 5 0; the program finds that the largest is 5 and the occurrence count for 5 is 4. Hint: Maintain two variables, max and count . max stores the current max number and count stores its occurrences. Initially, assign the first number to max and 1 to count . Compare each subsequent number with max . If the number is greater than max , assign it to to 1 . If the number is equal to max , increment count by 1 . Sample Run 1 Enter an integer (0: for end of input): 3 Enter an integer (0: for end of input): 5 Enter an integer (0: for end of input): 2 Enter an integer (0: for end of input): 5 Enter an integer (0: for end of input): 5 Enter an integer (0: for end of input): 5 Enter an integer (0: for end of input): 0 The largest number is 5 The occurrence count of the largest number is 4
Q1. Write a program in C++ language to obtain the equation below, for values of x from (1 - 20), by using for statement: 2 % v=5 4 costx— VR4 = 4 Il Q2. Write a program in C++ language to sum the elements of array A, array A with 10 integer elements, entering its value from keyboard.
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 Sample Run 2 Enter a string s1: split Enter a string s2: lisp split and lisp are not anagrams