quiz 5

Question 1

What is the output of the following?

def f(n):
return 2*n + f(n-1)

print(f(3))

Answer 1

f runs forever and causes StackOverflowError

Question 2

Consider a Python function f(x, y). For which data types of parameters x and y is it possible to get the same result as passing by reference?

Answer 2

dictionary and set

Question 3

The mechanism for passing parameters to a function in Python is:

Answer 3

call by assignment

Question 4

What is the base case for the following recursive function:

def f(b, q, n):
if n == 0:
return 0
else:
return b*q**(n-1) + f(b, q, n-1)

print(f(b=2, q=3, n=4))

Answer 4

n is 0

Question 5

What is the result of the following:

def f(n):
if n==1:
return 1
else:
return 2**n*f(n-1)

print(f(3))

Answer 5

32

Question 6

Arguments to functions always appear within:

Answer 6

parentheses: ( )

Question 7

What data type is used when returning multiple results from a function?

Answer 7

tuple

Question 8

What is the output of the following code?

def g(n, m):
if n <= 0:
return m
else:
return g(n-1, m+1)

print(g(2, 1))

Answer 8

3

Question 9

What Python statement allows to suspend function execution and resume it for next call(s)?

Answer 9

yield

Question 10

recursive functions require more computer resources and more execution time, whereas non-recursive require more lines of code

Answer 10

true