programming?
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
Related questions
Question
Please explain
![The Fibonacci sequence is defined as 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
The first two terms, f(0) and f(1), are equal to 1. Every subsequent term is the sum of the
two
previous terms. Thus for each n≥2n22, we have f(n)=f(n-1)+f(n-2).
Here are two Python programs to calculate f(n)f(n). One of these two methods uses
bottom-up dynamic programming and one of these two methods uses recursion. But which
one is which?
def fib1(n):
if n<=1: return 1
else: return fib1(n-1)+fib1(n-2)
def fib2(n):
table
[ for i in range(n+1)]
for i in range(n+1):
if i=1: table[i]=1
else: table[i]=table[i-1]+table[i-2]
return table[n]
BCA-
Looking at the program fragment, which of these is based on dynamic
programming?
Your answer should be written as: fib1 or fib2](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F9ec53c5c-d1c4-42dd-957e-ce8596851c7e%2F7c10cf9c-06e8-44e0-8f0d-5166dedae676%2F58zqklb_processed.jpeg&w=3840&q=75)
Transcribed Image Text:The Fibonacci sequence is defined as 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
The first two terms, f(0) and f(1), are equal to 1. Every subsequent term is the sum of the
two
previous terms. Thus for each n≥2n22, we have f(n)=f(n-1)+f(n-2).
Here are two Python programs to calculate f(n)f(n). One of these two methods uses
bottom-up dynamic programming and one of these two methods uses recursion. But which
one is which?
def fib1(n):
if n<=1: return 1
else: return fib1(n-1)+fib1(n-2)
def fib2(n):
table
[ for i in range(n+1)]
for i in range(n+1):
if i=1: table[i]=1
else: table[i]=table[i-1]+table[i-2]
return table[n]
BCA-
Looking at the program fragment, which of these is based on dynamic
programming?
Your answer should be written as: fib1 or fib2
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 with 1 images

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.Recommended textbooks for you

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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education