1. PUT THIS PSEUDO CODE INTO A RAPTOR PROGRAM.2. NEED A SCREENSHOT OF THE PROGRAM AND A .RAP FILE IF POSSIBLE.THANKS IN ADVANCE. 123 function get_user_choice ()45start678901234567890123456789while trueoutput ("Enter your choice: (R)ock, (P)aper, or (S)cissors")user_choice = input().toLowerCase()if user_choice is in ['r', 'p', 's']return user_choiceelsefunction get_computer_choice ()choices = ['r', 'p', 's']return random_choice (choices)function determine_winner (user, computer)if user is equal to computerreturn "It's a tie!"endoutput ("Invalid input! Please enter R, P, or S.")elseelse if (user is 'r' and computer is 's') or (user is 's' and computer is 'p') or (user is 'p' and computer is 'r')return "You win!"return "Computer wins."function play_game ()while true01234567 play_game()89user_choice = get_user_choice ()computer_choice = get_computer_choice ()output ("You chose: " + user_choice)output ("Computer chose: " + computer_choice)result = determine_winner (user_choice, computer_choice)output (result)play_again input ("Do you want to play again? (y/n): ").toLowerCase()if play_again is not equal to 'y'output ("Thanks for playing!")breakActivate WGo to Setting

Algorithm:Start the program.Define a function get_user_choice() to take user input for Rock (R),…

start function get_user_choice() while true output ("Enter your choice: (R)ock, (P)aper, or (S)cissors") user_choice = input().toLowerCase() if user_choice is in ['r', 'p', 's'] return user_choice else function get_computer_choice () choices = ['r', 'p', 's'] return random_choice (choices) function determine_winner (user, computer) if user is equal to computer return "It's a tie!" else if (user is 'r' and computer is 's') or (user is 's' and computer is 'p') or (user is 'p' and computer is 'r return "You win!" output ("Invalid input! Please enter R, P, or S.") else end return "Computer wins." function play_game() while true user_choice = get_user_choice() computer_choice = get_computer_choice() output ("You chose: " + user_choice) output ("Computer chose: " + computer_choice) result = determine_winner (user_choice, computer_choice) output (result) play_game () play_again = input ("Do you want to play again? (y/n): ").toLowerCase() if play_again is not equal to 'y' output ("Thanks for playing!") break Activa Go to Se

start function get_user_choice() while true output ("Enter your choice: (R)ock, (P)aper, or (S)cissors") user_choice = input().toLowerCase() if user_choice is in ['r', 'p', 's'] return user_choice else function get_computer_choice () choices = ['r', 'p', 's'] return random_choice (choices) function determine_winner (user, computer) if user is equal to computer return "It's a tie!" else if (user is 'r' and computer is 's') or (user is 's' and computer is 'p') or (user is 'p' and computer is 'r return "You win!" output ("Invalid input! Please enter R, P, or S.") else end return "Computer wins." function play_game() while true user_choice = get_user_choice() computer_choice = get_computer_choice() output ("You chose: " + user_choice) output ("Computer chose: " + computer_choice) result = determine_winner (user_choice, computer_choice) output (result) play_game () play_again = input ("Do you want to play again? (y/n): ").toLowerCase() if play_again is not equal to 'y' output ("Thanks for playing!") break Activa Go to Se

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 20PE

See similar textbooks

Similar questions

C language
Jupyter Notebook Fixed Income - Certicificate of Deposit (CD) - Compound Interest Schedule An interest-at-maturity CD earns interest at a compounding frequency, and pays principal plus all earned interest at maturity. Write a function, called CompoundInterestSchedule, that creates and returns a pandas DataFrame, where each row has: time (in years, an integer starting at 1), starting balance, interest earned, and ending balance, for an investment earning compoundedinterest. Use a for(or while) loop to create this table. The equation for theith year's ending balance is given by: Ei =Bi (1+r/f)f where: Ei is year i's ending balance Bi is year i's beginning balance (note: B1 is the amount of the initial investment (principal) r is the annual rate of interest (in decimal, e.g., 5% is .05) f is the number of times the interest rate compounds (times per year) The interest earned for a given year is Ei - Bi Note the term of the investment (in years) is not in the above equation; it is used…
vowelIndex Write a function vowelIndex that accepts a word (a str) as an argument and returns the index of the first vowel in the word. If there is no vowel, -1 is returned. For this problem, both upper and lower case vowels count, and 'y' is not considered to be a vowel. Sample usage: >>> vowelIndex('hello') 1 >>> vowelIndex('string') 3 >>> vowelIndex('string') 3 >>> vowelIndex('BUY') 1 >>> vowelIndex('APPLE') 0 >>> vowelIndex('nymphly') -1 >>> vowelIndex('string')==3 True >>> vowel Index ('nymphly')==-1 True
Hello! Please help me find the C language code of this. Thank You!
screenchot of input and output import string pp = '''Peter Piper picked a peck of pickled peppers.A peck of pickled peppers Peter Piper picked.If Peter Piper picked a peck of pickled peppersWhere's the peck of pickled peppers Peter Piper picked?''' def remove_punc(s):'''Returns a copy of string s with all punctuation removed'''#This function is already written - don't change it!for char in string.punctuation:s = s.replace(char, '')return s def count_words(text):'''Returns a dictionary with words and their counts'''pass#Create an empty dictionary#Split the text into a list of words#For each word in the list#If the word is not in the dictionary#Add it with a count of 1#Otherwise#Add 1 to the count#Return the dictionary def show_counts(word_dict):'''Display words and their counts'''pass#Get a list of the keys from word_dict#Put the words in alphabetical order#For each word in the list#Print the word and its count def main():'''Controls the program'''text = remove_punc(pp.lower()) #text…
JAVA CODE PLEASE Functions With No Parameters and Return Values Quiz by CodeChum Admin Create a function named banner that prints “CodyChum” with a newline. In the main function, write a program that accepts an integer input which would serve as an inclusive stopping point of a loop iteration that starts at the value of 1. If the number that loops through the range is divisible by either 2 or 3, then call the banner function, otherwise just print the number. Input 1. One line containing an integer Output First line is the integer user input. Succeeding multiple lines containing an integer or “CodyChum” 10 1 CodyChum CodyChum CodyChum 5 CodyChum 7 CodyChum CodyChum CodyChum
Code in Python: Your hangman game should be broken into appropriate functions, contain a main function, anddo the following:1. The program should randomly select a word from the list: kangaroo, capybara, wombat,koala, wallaby, quokka, platypus, dingo, kookaburra2. Repeatedly prompt the user to guess a letter.3. Validate the input4. All guessed letters should be stored in a two-dimensional list (from problem 2). If thenumber of times a letter has been guessed is greater than 1, then the user should benotified that they have already guessed this letter and prompted to guess a differentletter. The hangman won’t update (grow) if the same incorrect letter is guessed multipletimes.5. The word should be printed where all correctly guessed letters are revealed, and allunguessed letters are replaced with underscores6. A hangman reflecting the number of incorrect guesses should be printed7. If all the letters in the word are guessed, then the user wins. If the hangman / number ofincorrect…
true false void ffx() is a function with no return value void ffx() is a function with no argument int ffx(char x) is a function with int return value int ffx(char *x) is a function with parameter passed by reference char ffx( int x) is a function with int return value int ffc(char &x) is a function with parameter passed by reference
REVERSED SUM OF ODD POSITIONS Write a function that takes an integer(n) as input and returns True if the sum of its digits at odd positions is even, and returns False of otherwise. Positions are counted from the least significant digit. stion For example: n = 2345 →> True Explanation: The digits at odd positions are 5 and 3, and their sum i.e. 8 is even. Examples: rev_sum of odd_pos(2345) - True - False rev_sum_of_odd_pos(5728) *Note: Please return your output. Don't print your answer inside the function. Your code will not get evaluated, if you are using 'print statement inside the function." Answer: (penalty regime: 0 %) Reset answer 1-def rev_sun of odd pos (n: int)-> bool: 2 merite your code from here e
PYTHON without Def function Problem Statement A long stretch of beach is represented by a string of two characters: 0 - free, 1 - occupied. Due to recent restrictions, a new person cannot take a place next to another on the beach. In other words, there must be one free place between two people lounging on the beach. Define and implement a function sun_loungers to compute how many new people (at most) can lounge on a given beach. You may assume that no current loungers will move. Examples sun_loungers("10001") ➞ 1 # Can take place in the middle. sun_loungers("00101") ➞ 1 # Can take place on the left. sun_loungers("0") ➞ 1 # Can take one place. sun_loungers("000") ➞ 2 # Can take places on the left and on the right. Sample Input 1 "00010000" Sample Output 1 3
JAVA CODE PLEASE Recursive Functions Quiz by CodeChum Admin Create a recursive function named sequence that accepts an integer n. This function prints the first n numbers of the Fibonacci Sequence separated by a space in one line Fibonacci Sequence is a series of numbers in which each number is the sum of the two preceding numbers. In the main function, write a program that accepts an integer input. Call the sequence function by passing the inputted integer. Input 1. One line containing an integer Output Enter·a·number:·5 0·1·1·2·3
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.