
Starting Out with Python, Student Value Edition (4th Edition)
4th Edition
ISBN: 9780134444468
Author: Tony Gaddis
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 12, Problem 2PE
Program Plan Intro
Recursive Multiplication
Program Plan:
- • Define the “main()” function:
- ○ Initializes the variable “n1” as “0”
- ○ Initializes the variable “n2” as “0”
- ○ Check the value of “n1”.
- ■ If it is less than or equal to “0”, then get the first number from the user and store it to the variable “n1”.
- ○ Check the value of “n2”.
- ■ If it is less than or equal to “0”, then get the second number from the user and store it to the variable “n2”.
- ○ Call the function “multiplyRecursive()” and pass the two arguments “n1” and “n2”.
- • Define the “multiplyRecursive()” function:
- ○ Check the value of “x” and “y”
- ■ If it is equal to “0”, then return “0”.
- ■ Otherwise, call the function “multiplyRecursive()” to recursively perform the addition operation.
- ○ Check the value of “x” and “y”
- • Call the “main()” function.
Expert Solution & Answer

Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
7. See the code below and solve the following.
public class Test {
public static void main(String[] args) {
int result = 0;
}
result = fn(2,3);
System.out.println("The result is:
+ result);
// fn(x, 1) = x
// fn(x, y)
=
fn(x, y-1) + 2, when y>1
public static int fn(int x, int y) {
if (x <= 1)
return x;
else
return fn(x, y-1) + 2;
}
}
7-1. This program has a bug that leads to infinite recursion. Modify fn(int x, int y) method to fix
the problem. (2 point)
7-2. Manually trace the recursive call, fn(2,3) and show the output (step by step). (2 point)
7-3. Can you identify the Base Case in recursive method fn(int x, int y)? (1 point)
6. See the code below and solve the following.
import java.io.*;
public class DataStream {
}
public static void main(String[] args)
}
DataOutputStream output = new DataOutputStream(new FileOutputStream("temp.dat"));
output.writeUTF("Book1");
output.writeInt(85);
output.writeUTF("Book2");
output.writeInt(125);
output.writeUTF("Book3");
output.writeInt(70);
output.close();
// ToDo: Read all data from temp.dat and print the data to the standard output (monitor)
6-1. This program has a compile error, and the message is “Unhandled exception type
FileNotFoundException". How do you fix this error? (1 point)
6-2. Is FileNotFoundException a checked exception or an unchecked exception? (1 point)
6-3. What is the difference between checked exception and unchecked exception? (1 point)
6-4. Please complete the above program by reading all data from temp.dat and print the data
to the standard output (monitor) by using System.out.print, System.out.println or
System.out.printf method. (2 points)
Write a program that reads a list of integers from input and determines if the list is a palindrome (values are identical from first to last and last to first). The input begins with an integer indicating the length of the list that follows. Assume the list will contain a maximum of 20 integers. Output "yes" if the list is a palindrome and "no" otherwise. The output ends with a newline.
Hints: - use a for loop to populate the array based on the specified size (the first number entered)
- use a for loop to check first value with last value, second value with second from end, etc.
- if the values do not match, set a Boolean variable to flag which statement to output (yes or no)
Ex: If the input is (remember to include spaces between the numbers):
6 1 5 9 9 5 1
the output is:
yes
Ex: If the input is:
5 1 2 3 4 5
the output is: C++ coding
Chapter 12 Solutions
Starting Out with Python, Student Value Edition (4th Edition)
Ch. 12.2 - It is said that a recursive algorithm has more...Ch. 12.2 - Prob. 2CPCh. 12.2 - What is a recursive case?Ch. 12.2 - What causes a recursive algorithm to stop calling...Ch. 12.2 - What is direct recursion? What is indirect...Ch. 12 - Prob. 1MCCh. 12 - A function is called once from a program's main...Ch. 12 - Prob. 3MCCh. 12 - Prob. 4MCCh. 12 - Prob. 5MC
Ch. 12 - Prob. 6MCCh. 12 - Any problem that can be solved recursively can...Ch. 12 - Actions taken by the computer when a function is...Ch. 12 - A recursive algorithm must _______ in the...Ch. 12 - A recursive algorithm must ______ in the base...Ch. 12 - An algorithm that uses a loop will usually run...Ch. 12 - Some problems can be solved through recursion...Ch. 12 - It is not necessary to have a base case in all...Ch. 12 - In the base case, a recursive method calls itself...Ch. 12 - In Program 12-2 , presented earlier in this...Ch. 12 - In this chapter, the rules given for calculating...Ch. 12 - Is recursion ever required to solve a problem?...Ch. 12 - When recursion is used to solve a problem, why...Ch. 12 - How is a problem usually reduced with a recursive...Ch. 12 - What will the following program display? def...Ch. 12 - Prob. 2AWCh. 12 - The following function uses a loop. Rewrite it as...Ch. 12 - Prob. 1PECh. 12 - Prob. 2PECh. 12 - Prob. 3PECh. 12 - Largest List Item Design a function that accepts a...Ch. 12 - Recursive List Sum Design a function that accepts...Ch. 12 - Prob. 6PECh. 12 - Prob. 7PECh. 12 - Ackermann's Function Ackermann's 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
- Design and draw a high-level "as-is" process diagram that illustrates a current process related to a product or service offered through the SSDCI.gov database.arrow_forwardCompare last-mile connections for connecting homes and businesses to the Internetarrow_forwardExplain wireless networking standardsarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage LearningC++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology PtrProgramming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
- Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,COMPREHENSIVE MICROSOFT OFFICE 365 EXCEComputer ScienceISBN:9780357392676Author:FREUND, StevenPublisher:CENGAGE LEBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT

C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning

C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage

Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
COMPREHENSIVE MICROSOFT OFFICE 365 EXCE
Computer Science
ISBN:9780357392676
Author:FREUND, Steven
Publisher:CENGAGE L

EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT