Read the string variables visitedListName, place1, place2, and place3 from input, assuming that the list's name contains multiple words and each place visited is a single word. The first input line contains the list's name and the second input line contains the places visited. Ex: If the input is: Countries I've visited Qatar Zambia Malta then the output is: Countries I've visited: Qatar Zambia Malta #include #include using namespace std; int main() { string visitedListName; string place1; string place2; string place3; /* Your code goes here */ cout << visitedListName << ":" << endl; cout << place1 << endl; cout << place2 << endl; cout << place3 << endl; return 0; }

Read the string variables visitedListName, place1, place2, and place3 from input, assuming that the list's name contains multiple words and each place visited is a single word. The first input line contains the list's name and the second input line contains the places visited. Ex: If the input is: Countries I've visited Qatar Zambia Malta then the output is: Countries I've visited: Qatar Zambia Malta #include #include using namespace std; int main() { string visitedListName; string place1; string place2; string place3; /* Your code goes here */ cout << visitedListName << ":" << endl; cout << place1 << endl; cout << place2 << endl; cout << place3 << endl; return 0; }

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 4GZ

See similar textbooks

Similar questions

A spoonerism is when the first letters / sounds of two words are transposed onto one another. Create a function that takes a two-word string and performs a spoonerism on the phrase. Examples spoonerise ("history lecture") "listory hecture" spoonerise("loud noises") → "noud loises" spoonerise("chow mein") → "mow chein" spoonerise ("edabit rules!") Notes → "redabit ules!" • Only two words will be parsed into the function. Don't worry about handling more than two. • You won't always just have to swap the first letters, take care to notice which letters have been switched in the examples (notice the difference between vowel-starting and consonant-starting words).
get_nth_comma_in_string(s, n): This function takes a string s and a non-negative integer n as input. It returns the index of the n’th comma in the string s. We will start counting at 0, so if n=0, then the index of the first comma should be returned; if n=1, then the index of the second comma should be returned, and so on. If there is no n’th comma in s, then -1 should be returned. Note: You may use the string find method in this function.
Python Previously, your check_move function took two separate arguments: a column and a row value. Now you will rewrite the function to accept the board position as a single string argument. In other words, write check_move (position) which takes position strings such as '85" that include both the column and the row value of a chess board. • When both the coordinates in position are valid, for example, "c4", the function returns 'The piece is moved to C4.'. • If position has too many or too few characters, return 'The position is not valid.' • If the first coordinate is out of range (regardless of whether the second one is or not) return 'The column value is not in the range a-h or A-HI¹. . Otherwise, if the second coordinate is out of range, return 'The row value is not in the range 1 to 81¹. Note that, irrespective of the casing of the column value, your code should output the value in upper case. Your function should work like this: >>> check_move('B4') 'The piece is moved to B4.'…
The function last_words in python takes one parameter, fname, the name of a text file, and returns a list containing the last word from each line of the file. For example, if the file contents are: apples are red bananas are yellow limes are green then the list ["red", "yellow", "green"] should be returned. NOTE: You may assume the file will contain no blank lines. BIG HINT: If line is a string representing a line of text (inside a for loop!), then L = line.split() creates a list of the words in the line. For example: Test Result L = last_words("wordlist1.txt") print(L) ['happy', 'sad', 'angsty', 'euphoric', 'maudlin']
3. Complete the function count_digits. This function takes one parameter - a string (s). It should return the number of digits in s. For example, if s is "25 or 6 to 4 is a song by Chicago" then count_digits should return 4. count_digits should not print the result- it should return it. Do not change anything outside count_digits. Save & Run Load History Show CodeLens 1 def count_digits(s): 2 ''Returns the number of digits in s''" 3 pass #Hint: make a string of digits to use #in checking whether each character #is a digit. And use the accumulator #pattern 4 6. 7 8. 9 user_string 10 num_digits 11 print("There are", num_digits, "digits in", user_string) input("Please enter a string: ") count_digits(user_string) 12
Cyclops numbersdef is_cyclops(n):A nonnegative integer is said to be a cyclops number if it consists of an odd number of digits so that the middle (more poetically, the “eye”) digit is a zero, and all other digits of that number are nonzero. This function should determine whether its parameter integer n is a cyclops number, and return either True or False accordingly n Expected result 0 True 101 True 98053 True 777888999 False 1056 False 675409820 False
Create the game of Hangman.In the game of Hangman, the computer chooses a word at random from a given list of words. This word is the answer. The player then tries to guess the word, by guessing one letter at a time. This program is an interactive Hangman game. The focus is to use and manipulate strings and loops. Whenever the user guesses a letter that is in the answer, all occurrences of that letter are revealed to the user.___ The game ends when the user has guessed every letter in the word, before he reaches the allowed number of strikes (usually 5).
get_nth_word_from_string(s, n): This function takes a string s and a non-negative integer n as input. The string s may contain substrings of text separated by commas. The function should return the n’th comma-separated substring. We will start counting at 0, so if n=0, then the first substring should be returned (i.e., everything before the first comma, if there is such a comma); if n=1, then the second substring should be returned (i.e., everything between the first comma and second comma, if there is such a comma); and so on. If there is no n’th substring in s, then the empty string should be returned. Note: You may use the string count method in this function. Note: If a space follows a comma, do not include the space as part of the substring to be returned.
get_nth_word_from_string(s, n): This function takes a string s and a non-negative integer n as input. The string s may contain substrings of text separated by commas. The function should return the n’th comma-separated substring. We will start counting at 0, so if n=0, then the first substring should be returned (i.e., everything before the first comma, if there is such a comma); if n=1, then the second substring should be returned (i.e., everything between the first comma and second comma, if there is such a comma); and so on. If there is no n’th substring in s, then the empty string should be returned. Note: You may use the string count method in this function. Note: If a space follows a comma, do not include the space as part of the substring to be returned. >>> get_nth_word_from_string("dreary, pondered, weak, weary", 0) 'dreary'
Complete the Funnyville High School registration program where user is prompted for her full name and the program generates email id and temporary password. Sample run: generate_EmailID: This function takes two arguments: the user’s first name and last name and creates and returns the email id as a string by using these rules: The email id is all lower case. email id is of the form “last.first@fhs.edu”. e.g. For "John Doe" it will be "doe.john@fhs.edu". See sample runs above. generate_Password: This function takes two arguments: the user’s first name and last name and generates and returns a temporary password as a string by using these rules. Assume that user's first and last names have at least 2 letters. The temporary password starts with the first 2 letters of the first name, made lower case. followed by a number which is the sum of the lengths of the first and last name (For example this number will be 7 for "John Doe" since length of "John" is 4 and length of "Doe" is…
Yahtzee! Yahtzee is a dice game that uses five die. There are multiple scoring abilities with the highest being a Yahtzee where all five die are the same. You will simulate rolling five die 777 times while looking for a yahtzee. Program Specifications : Create a list that holds the values of your five die. Populate the list with five random numbers between 1 & 6, the values on a die. Create a function to see if all five values in the list are the same and IF they are, print the phrase "You rolled ##### and its a Yahtzee!" (note: ##### will be replaced with the values in the list) Create a loop that completes the process 777 times, simulating you rolling the 5 die 777 times, checking for Yahtzee, and printing the statement above when a Yahtzee is rolled. When you complete the project please upload your .py file to the Project 2 folder by the due date.
Brussel's choice def brussels_choice_step(n, mink, maxk): This problem is adapted from another jovial video "The Brussel's Choice" of Numberphile (a site so British that you just know there has to be a Trevor and a Colin somewhere in there) whose first five minutes you should watch to get an idea of what is going on. This function should compute and return the list of all numbers that the positive integer n can be converted to by treating it as a string and replacing some substring m of its digits with the new substring of either 2*m or m/2, the latter substitution allowed only when m is even so that dividing it by two produces an integer. This function should return the list of numbers that can be produced from n in a single step. To keep the results more manageable, we also impose an additional constraint that the number of digits in the chosen substring m must be between mink and maxk, inclusive. The returned list must contain the numbers in ascending sorted order.