List of top Computer Science Questions on Programming Languages asked in GATE DA

A recursive function is given:
def mystery(n): 
if n $<=$ 0: 
return 1 
else: 
return mystery(n-1) + mystery(n-2) 
Find the value of mystery(4). 

Assume a typical runtime stack is used for the recursive function mystery(n) as defined earlier. How many total function calls (stack activations), including the initial call, are made to compute mystery(4)?

def fun(L, i=0):
if i $>=$ len(L) - 1: 
return 0 
if L[i]> L[i+1]: 
L[i+1], L[i] = L[i], L[i+1] 
return 1 + fun(L, i+1) 
else: 
return fun(L, i+1) 
data = [5, 3, 4, 1, 2] 
count = 0 
for _ in range(len(data)): 
count += fun(data) 
print(count) 
 

def append_to_lst(val, lst=[]):
lst.append(val)
return lst
print(append_to_lst(1))
print(append_to_lst(2))
print(append_to_lst(3, []))
def outer():
x = []
def inner(val):
x.append(val)
return x
return inner
f1 = outer()
f2 = outer()
print(f1(10)) \# line P
print(f1(20)) \# line Q
print(f2(30)) \# line R
print(f1(40)) \# line S
Which of the following is/are correct?