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)
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)
Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter9: Advanced Modularization Techniques
Section: Chapter Questions
Problem 13RQ
Related questions
Question
![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)](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F1f1cff89-d0c3-401a-ba77-d9b5f81fcda4%2Ffa72c254-503d-45bd-aaea-07b10b4824af%2F3f59zt_processed.png&w=3840&q=75)
Transcribed Image Text: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)
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps

Recommended textbooks for you
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage

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

Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage

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

Microsoft Visual C#
Computer Science
ISBN:
9781337102100
Author:
Joyce, Farrell.
Publisher:
Cengage Learning,

C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr

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

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