When going through a section, try the Self-check exercises. The solutions are given at the end of each chapter. 1. Determine the output from the following program: public static void main (String[] zzz) { int result = comp(4, 2); out.println ("Result = " + result); } // end main Output comp (4, 2) called comp (3, 2) called comp (2, 2) called comp (2, 1) called comp (1, 1) called comp (1, 0) called comp (3, 1) called comp (2, 1) called comp (1, 1) called comp (1, 0) called comp (2, 0) called Result = 6 static int comp(int n, int k) { out.println("comp(" + n + ", " + k + ") called"); if ( (n == k) || (k 0) ) == return 1; int a = comp (n int b = comp (n - 1, k - 1); return a + b; } // end comp 1, k); The tree diagram of recursive calls comp(4, 2)↑6 comp(3, 2)↑3 comp(3, 1)↑3 comp(2, 2)↑1 comp(2, 1)↑2 comp(2, 1)↑2 comp(2, 0)↑1 comp(1, 1)↑1 comp(1, 0)↑1 comp(1, 1)↑1 comp(1, 0)↑1

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

CAN SOMONE EXPLAIN THIS TO ME?

  

When going through a section, try the Self-check exercises. The solutions are given at the end of each chapter.
1. Determine the output from the following program:
public static void main (String[] zzz) {
int result = comp (4, 2);
out.println ("Result
} // end main
Output
comp ( 4, 2) called
comp (3, 2) called
comp (2, 2) called
comp (2, 1) called
" + result);
%3D
comp (1, 1) called
comp (1, 0) called
comp (3, 1) called
comp (2, 1) called
comp (1, 1) called
static int comp (int n, int k) {
out.println ("comp (" + n + ", " + k + ") called");
if ( (n ==
k) || (k == 0) )
return 1;
int a = comp (n
int b = comp (n
return a + b;
} // end comp
The tree diagram of recursive calls
1, k);
comp (1, 0) called
comp (2, 0) called
1, k
1);
Result
comp(4, 2)↑6
comp(3, 2)↑3
comp(3, 1)↑3
comp(2, 2)↑1
comp(2, 1)↑2
comp(2, 1)↑2
comp(2, 0)↑1
comp(1, 1)↑1 comp(1, 0)↑1 comp(1, 1)↑1 comp(1, 0)↑1
Transcribed Image Text:When going through a section, try the Self-check exercises. The solutions are given at the end of each chapter. 1. Determine the output from the following program: public static void main (String[] zzz) { int result = comp (4, 2); out.println ("Result } // end main Output comp ( 4, 2) called comp (3, 2) called comp (2, 2) called comp (2, 1) called " + result); %3D comp (1, 1) called comp (1, 0) called comp (3, 1) called comp (2, 1) called comp (1, 1) called static int comp (int n, int k) { out.println ("comp (" + n + ", " + k + ") called"); if ( (n == k) || (k == 0) ) return 1; int a = comp (n int b = comp (n return a + b; } // end comp The tree diagram of recursive calls 1, k); comp (1, 0) called comp (2, 0) called 1, k 1); Result comp(4, 2)↑6 comp(3, 2)↑3 comp(3, 1)↑3 comp(2, 2)↑1 comp(2, 1)↑2 comp(2, 1)↑2 comp(2, 0)↑1 comp(1, 1)↑1 comp(1, 0)↑1 comp(1, 1)↑1 comp(1, 0)↑1
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Matrix multiplication
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.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education