Given string userInput on one line and string endString on a second line, assign concatStr with the copy of userInput with endString appended. Ex: If the input is: Fuzzy bear !!! then the output is: Fuzzy bear!!! #include #include using namespace std; int main() { string userInput; string endString; string concatStr; getline(cin, userInput); getline(cin, endString); /* Your code goes here */ cout << concatStr << endl; return 0; }

Given string userInput on one line and string endString on a second line, assign concatStr with the copy of userInput with endString appended. Ex: If the input is: Fuzzy bear !!! then the output is: Fuzzy bear!!! #include #include using namespace std; int main() { string userInput; string endString; string concatStr; getline(cin, userInput); getline(cin, endString); /* Your code goes here */ cout << concatStr << endl; return 0; }

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

Write a function that when given a URL as a string, parses out just the domain name and returns it as a string. Examples:domain_name("http://github.com/SaadBenn") == "github" domain_name("http://www.zombie-bites.com") == "zombie-bites"domain_name("https://www.cnet.com") == "cnet"Note: The idea is not to use any built-in libraries such as re (regular expression) or urlparse except .split() built-in function""" # Non pythonic waydef domain_name_1(url): #grab only the non http(s) part full_domain_name = url.split('//')[-1] #grab the actual one depending on the len of the list actual_domain = full_domain_name.split('.') # case when www is in the url if (len(actual_domain) > 2): return actual_domain[1] # case when www is not in the url return actual_domain[0] # pythonic one linerdef domain_name_2(url):
1.a. Write a Regular Expression Language over ∑ = {a,b,c} a set of strings terminated by a or b. .b. Write a regular expression for the set of binary strings where each string has at least one pair of consecutive zeros. c. write the regular expression for the following, where sigma = (a,b): i. string of length at least 2 ii. string of length at most 2 iii. all string starting with a and ending with b iv. Even length Strings
OCaml Code: Please fix all the errors needed for interpreter.ml and use the test cases to test the code. Make sure to give the correct code with the screenshots of the test cases passing the code. interpreter.ml type stackValue = BOOL of bool | INT of int | ERROR | STRING of string | NAME of string | UNIT type command = ADD | SUB | MUL | DIV | PUSH of stackValue | POP | REM | NEG | TOSTRING | SWAP | PRINTLN | QUIT let interpreter (input, output) = let ic = open_in input in let oc = open_out output in let rec loop_read acc = try let l = String.trim (input_line ic) in loop_read (l :: acc) with End_of_file -> List.rev acc in let strList = loop_read [] in let str2sv s = match s with | ":true:" -> BOOL true | ":false:" -> BOOL false | ":error:" -> ERROR | ":unit:" -> UNIT | _ -> let rec try_parse_int str = try INT…
Code in Python The function first_three takes one string parameter, word, and returns a slice of length three from the front of word. However, if word has length less than three, then the None object is returned instead. Hint: Use an if-else decision and the slicing operator [ : ] to solve this problem. For example: Test Result word = "happy" if type(first_three(word)) != type("ok"): print("error") else: print(first_three(word)) hap word = "dog" if type(first_three(word)) != type("ok"): print("error") else: print(first_three(word)) dog word = "" if type(first_three(word)) != type(None): print("error") else: print(first_three(word)) None
Write in c language please, The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which has an index n as a parameter and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: Fibonacci(7) is 13 Note: Use a for loop and DO NOT use recursion.
Write code in C++, C# or Python to solve the following problem: In a party there are N persons and we have M raffles. One person may participate in any number of raffles (from 0 to M). At the end of the day, host of the party comes to you and gives you M lists. Each list contains multiple integer numbers which are the "raffle ID numbers" of the participants. Then, for each list an integer number, I, is announced to determine the winner of the raffle: the winner is the person with raffle ID number K such that K is larger than exactly I numbers in that list. To help the host to find the winners you want to write a program. Input Format First line of the input is N and M. Then, there are M lines, each one contains integer numbers between 1 and N. Each list may contain at most N numbers. At the end of each line there is -1. After these lines there is one line which contains M integers to announce the winners. If the j-th number in this line is I it means that the winner of list j…
In C++, finish the Robot Paths code. Here is the starter code: int paths(int i, int j) { static int p[5][5] = {0}; if (i == 0 || j == 0) return 1; if (p[i][j] != 0) return p[i][j]; return paths(i, j-1) + paths(i-1, j);}
Given an array of strings strs, group the anagrams together. You can return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original letters exactly once. Example 1: Input: strs = ["eat","tea","tan","ate","nat","bat"] Output: [["bat"],["nat","tan"],["ate","eat","tea"]] Example 2: Input: strs = [""] Output: [[""]] Example 3: Input: strs = ["a"] Output: [["a"]] Constraints: 1 <= strs.length <= 104 0 <= strs[i].length <= 100 strs[i] consists of lowercase English letters.
In Python, The function concatAltChars takes a string parameter s and a boolean parameter even; the function concatenates together either the even-position characters of s or the odd-position characters of s, depending on whether even is True, or False, respectively. The accumulated string is returned. For example, the even-indexed characters of "HANOVER" are at indexes 0, 2, 4, and 6: H N V R. So, concatAltChars("HANOVER", True) returns the string result "HNVR". But concatAltChars("HANOVER", False) returns the string result "AOE". For example: Test Result s = "goldfinches" print(concatAltChars(s, True)) glfnhs s = "A" print(concatAltChars(s, True)) A s = "A" print(concatAltChars(s, False))
Given subsets A and B of a universal set with 10 elements {0, 1, 2, 3, 4, 5, 6, 7, 8,9}. Write a C++ or Java program that uses bit strings to find A È B, A Ç B, and A – B. Print tothe screen set A, set B ( be sure to print out the name of the sets), as well as the set operation results(be sure to print out the name of the operations).The program requires that elements of subsets A and B are from user input. You can make theassumption that user input numbers are within the domain of the set {0, 1, 2, ..., 9} and there isno improper input.Additional requirements and reminders:• The use of STL, templates, and operator overloading is not permitted in any form.• Remember: You must use a bit string when representing a set. You may not use an array ofBoolean variables.• The elements of subset A and subset B must from user input. You may not hardcode the twosubsets in your program.
java: Run length coding is a method to represent a string in a more compact manner. Each character that occurs more than 2 times in a row is represented by the character and a number following it. Two examples are: "abba" → "abba""abcccbbbba" → "abc3b4a"Write a function that calculates how many characters the encoded string is shorter than the original.
In python, the function slice_middle takes a string parameter, word. If the length of word is less than 3, the function returns the empty string. Otherwise, the function returns a substring made of all but the first and last characters in word. For example: Test Result print(slice_middle("onion")) nio print(slice_middle("?")) print(slice_middle("slicing")) licin