Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
5th Edition
ISBN: 9780134801155
Author: Tony Gaddis
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 13, Problem 4MC
Program Description Answer
In this case the problem can be solved using “recursion” and it is also referred as “general case”.
Hence the correct answer is option “D”.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
If your first name starts with a letter from A-J inclusively:
Write a recursive method that takes a string as argument and determines if the string has more vowels than consonants. Test the method by asking the user to enter a string. Hint: Write your recursive method to first count vowels and consonants.
(C PROGRAM ONLY)
1. Undercover Mission Planby CodeChum Admin
Hi Programmer, I'm Agent J.
I'm preparing for an undercover mission going to the enemy's base. However, it seems that my plans are still missing some few details.
Can you help me with this?
Instructions:
In the code editor, there's a main() function that calls the recursive printPlan() function.The printPlan() function already contains some code but it seems to be missing a base case that makes it stop. Supposedly, this printPlan() function should only print the plan by n / 2 number of times. For example, if n is 10, then this should only print the plan 5 times or if n is 20, then this should only print the plan 10 times.Fix this function by adding the correct condition in its base case.For this problem, assume that the value of n is always divisible by 2.Input
1. Value of n
Output
Enter n: 6Plan by Agent J.Plan by Agent J.Plan by Agent J.
1.)I have to recursive with python language and was asked to do a buy 2 get 1 free where you have some amount of money(x) each item costs a given amount(y), for each 2 item you get 1 free, builda recursive solution to find out how many items you can buy for x amount of money.
2.) Buy M, get N free
Then alter your first answer to allow for the user to enter any M and N for how many you need to buy to get free items
Chapter 13 Solutions
Starting Out with Programming Logic and Design (5th Edition) (What's New in Computer Science)
Ch. 13.2 - It is said that a recursive algorithm has more...Ch. 13.2 - Prob. 13.2CPCh. 13.2 - What is a recursive case?Ch. 13.2 - What causes a recursive algorithm to stop calling...Ch. 13.2 - What is direct recursion? What is indirect...Ch. 13 - Prob. 1MCCh. 13 - A module is called once from a programs main...Ch. 13 - The part of a problem that can be solved without...Ch. 13 - Prob. 4MCCh. 13 - Prob. 5MC
Ch. 13 - Prob. 6MCCh. 13 - Any problem that can be solved recursively can...Ch. 13 - Actions taken by the computer when a module is...Ch. 13 - A recursive algorithm must _______ in the...Ch. 13 - A recursive algorithm must _____ in the base case....Ch. 13 - An algorithm that uses a loop will usually run...Ch. 13 - Some problems can be solved through recursion...Ch. 13 - It is not necessary to have a base case in all...Ch. 13 - In the base case, a recursive method calls itself...Ch. 13 - In Program 13-2, presented earlier in this...Ch. 13 - In this chapter, the rules given for calculating...Ch. 13 - Is recursion ever required to solve a problem?...Ch. 13 - When recursion is used to solve a problem, why...Ch. 13 - How is a problem usually reduced with a recursive...Ch. 13 - What will the following program display? Module...Ch. 13 - What will the following program display? Module...Ch. 13 - The following module uses a loop. Rewrite it as a...Ch. 13 - Prob. 1PECh. 13 - Prob. 2PECh. 13 - Recursive Array Sum Design a function that accepts...Ch. 13 - Prob. 4PECh. 13 - Prob. 5PECh. 13 - Ackermanns Function 7. Ackermanns Function is a...
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Alert dont submit AI generated answer. Write Java program with a recursive method called evenfact(N) which takes in a number N and returns the factorial of the even numbers between the given number N and 2.arrow_forwardCODE USING C++ 1. Undercover Mission Plan by CodeChum Admin Hi Programmer, I'm Agent J. I'm preparing for an undercover mission going to the enemy's base. However, it seems that my plans are still missing some few details. Can you help me with this? Instructions: In the code editor, there's a main() function that calls the recursive printPlan() function. The printPlan() function already contains some code but it seems to be missing a base case that makes it stop. Supposedly, this printPlan() function should only print the plan by n / 2 number of times. For example, if n is 10, then this should only print the plan 5 times or if n is 20, then this should only print the plan 10 times. Fix this function by adding the correct condition in its base case. For this problem, assume that the value of n is always divisible by 2. Input 1. Value of n Output Enter n: 6 Plan by Agent J. Plan by Agent J. Plan by Agent J.arrow_forwardWrite a direct and indirect recursive method for validating input data for the triangle program. There is a live demo in this module's lecture. The equations for a triangle based on three sides is. float s = (sA + sB + sC) / 2; float per = (sA + sB + sC); float area = (float) Math.pow((s * (s - sA) * (s - sB) * (s - sC)), .5);arrow_forward
- Create a java code using recursion with a class name labRecActTwo_<surname>. The java program prompts the user to input string minimum of 4 letters word and display the anagram.arrow_forwardC++ For the following code: int fact(int n) { if (n == 0) return 1; else return n * fact(n - 1); } Which of the following are true? A. Group of answer choices B. This function is not recursive. C. This function is recursive. D. The base case is when n!=0 E. The base case is when n ==0arrow_forwardWrite a java recursive program to solve the "Missionaries and Cannibals" problem:Three missionaries and three cannibals come to a river and find a boat that holds two. If the cannibals ever outnumber the missionaries on either bank, the missionaries will be eaten. How might they cross safely? Input a character from the keyboard either a c (cannibal) or m (missionary). Check case and error check inputs. The output should include the initial problem, the moves you make, and a "picture" of the current state of the puzzle after each move (round). The final output should include the total number of rounds needed to solve the problem. Finally, ask the user if they wish to run the program again. The program must use recursion as part of the solution. Refer to the sample output below. Sample Run (partial):Crossing the River-----------------------------------------Round 0Left RightMMMCCCBoatFirst passenger (c for cannibal, m for missionary): HIllegal Input!First passenger (c for cannibal, m for…arrow_forward
- This is recursive homework is being a bit tough please java code with comments. Thanksarrow_forwardIn Java code do the following:Write a method that accepts a String as an argument. The method should use recursion to display each individual character in the String:arrow_forwardWrite a recursive method that converts a decimal number intoa hex number as a string. The method header ispublic static String dec2Hex(int value)Write a test program that prompts the user to enter a decimal number and displaysits hex equivalent.arrow_forward
- Write a recursive method that converts a decimal numberinto a binary number as a string. The method header ispublic static String dec2Bin(int value)Write a test program that prompts the user to enter a decimal number and displaysits binary equivalent.arrow_forwardThe following recursive method has been created. This method accepts two integer parameters called a and b respectively. Assume that the name of the method is m and the code in the recursive method is: if ( a > b ) return; if(a % 10 == 3) System.out.print(a+ " "); m(a+1, b); <---- recursive call } what would be the output with the following call m(1,50) where a is 1 and b is 50arrow_forwardNeed help Writing a function, countVowels, that accepts a string as an argument. countVowels should return the number of vowels in that string. Use recursion. example countVowels('Four score and seven years'); // => 9arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENTC++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning