Consider the following code segments: 1: function Fun Rec(k) 2: if k=0 then: 3: return 0 4: 5: 6: 7: end function else: return Fun Rec(k-1) + k end if 8: 9: result = 0 10: forj=1 to n do 11: result = result + FunRec(j) 12: end for 13: Print result (a) When Fun Rec(k) is called (assume k is an integer and k > 0), how many times is the function called before the initial call is terminated? Give the answer in terms of k. (b) What does Fun Rec(k) return? Give the answer in terms of k. (c) How many times is Fun Rec called in total? Include the calls on line 11 as well as the recursive calls. Give the answer in terms of n. (d) What is final value of result in line 13? Give the answer in terms of n.

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
Consider the following code segments:
1: function Fun Rec(k)
2:
if k = 0 then:
3:
return 0
4:
5:
6:
end if
7: end function
8:
9: result = 0
10: for j = 1 to n do
11:
else:
return Fun Rec(k − 1) + k
result = result + FunRec(j)
12: end for
13: Print result
(a) When Fun Rec(k) is called (assume k is an integer and k > 0), how many times is the
function called before the initial call is terminated? Give the answer in terms of k.
(b) What does FunRec(k) return? Give the answer in terms of k.
(c) How many times is Fun Rec called in total? Include the calls on line 11 as well as the
recursive calls. Give the answer in terms of n.
(d) What is final value of result in line 13? Give the answer in terms of n.
Transcribed Image Text:Consider the following code segments: 1: function Fun Rec(k) 2: if k = 0 then: 3: return 0 4: 5: 6: end if 7: end function 8: 9: result = 0 10: for j = 1 to n do 11: else: return Fun Rec(k − 1) + k result = result + FunRec(j) 12: end for 13: Print result (a) When Fun Rec(k) is called (assume k is an integer and k > 0), how many times is the function called before the initial call is terminated? Give the answer in terms of k. (b) What does FunRec(k) return? Give the answer in terms of k. (c) How many times is Fun Rec called in total? Include the calls on line 11 as well as the recursive calls. Give the answer in terms of n. (d) What is final value of result in line 13? Give the answer in terms of n.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Datatypes
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
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