1. Find the first 6 terms of the recurrence relation given by a1 = -1, an = 2n – an-1 2. a. Create a Python recursive function for the relation in #1. b. Create a Python program that uses a for loop to repeatedly invoke the recursive. the function you created and to print each term up to and including a6. Include a screenshot of the Python file that contains your function code and your program code. Include a screenshot of your IDLE output. 3. Trace the following function. Do not just provide the output. Include the state of memory for each function call (use your text as a guide). Show the value of n and the value of f(n) for each value of n. Show return values. Show what is printed for each value of n, as well as the result of any other print statements: def f(n): print (n) if n ==0: return 5 else: return (n**2) + f(n-1) print (“Invoking the function”) print (f(3)) print (“done”)
1. Find the first 6 terms of the recurrence relation given by
a1 = -1, an = 2n – an-1
2. a. Create a Python recursive function for the relation in #1.
b. Create a Python program that uses a for loop to repeatedly invoke the recursive. the function you created and to print each term up to and including a6.
Include a screenshot of the Python file that contains your
function code and your program code. Include a screenshot of your IDLE output.
3. Trace the following function. Do not just provide the output. Include the state of memory for each function call (use your text as a guide). Show the value of n and the value of f(n) for each value of n. Show return values. Show what is printed for each value of n, as well as the result of any other print statements:
def f(n):
print (n)
if n ==0:
return 5
else:
return (n**2) + f(n-1)
print (“Invoking the function”)
print (f(3))
print (“done”)
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 2 images
