Python Quiz

1) Which of these is false about recursion?

1 point

Recursive function can be replaced by a non-recursive function

Recursive functions usually take more memory space than non-recursive function

Recursive functions run faster than non-recursive function

Recursion makes programs easier to understand

Clear selection

2) Fill in the line of the following Python code for calculating the factorial of a number def fact(num): if num == 0: return 1 else: return _____________________

1 point

num*fact(num-1)

(num-1)*(num-2)

num*(num-1)

fact(num)*fact(num-1)

Clear selection

3)What will be the output of the following Python code? def test(i,j): if(i==0): return j else: return test(i-1,i+j)print(test(4,7))

2 points

13

7

INFINITE

17

Clear selection

4) What is the average case complexity of selection sort?

1 point

O(nlogn)

O(logn)

O(n)

O(n2)

Clear selection

5) What is the average case complexity of MERGE sort?

1 point

O(nlogn)

O(logn)

O(n)

O(n2)

Clear selection

6) What is the average case complexity of Linear Search?

1 point

O(nlogn)

O(logn)

O(n)

O(n2)

Clear selection

7)What is tail recursion?

1 point

A recursive function that has two base cases

A function where the recursive functions leads to an infinite loop

A recursive function where the function doesn’t return anything and just prints the values

A function where the recursive call is the last thing executed by the function

Clear selection

8) What is the average case complexity of Binary Search?

1 point

O(nlogn)

O(logn)

O(n)

O(n2)

Clear selection

9) what is the output of following code? def fun(n): if (n > 100): return n - 5 return fun(fun(n+11)); print(fun(55))

2 points

60

100

98

50

Clear selection

10)The time complexity of the solution tower of hanoi problem using recursion is _________

1 point

O(n2)

O(2 power n)

O(n log n)

O(n)

Clear selection

11) def f1(): x=100 print(x)x=+1 f1() what will be the output?

2 points

Error

100

101

99

Clear selection

What will be the output of the following Python code?1 def a(n) : if n == 0: . return o . elif n == 1: . return 1 . else: . return a(n-1)+a(n-2) . for i in range(0,4): . print(a(i),end=" ")

2 points

0123

0112

1122

0011

Other:

Clear selection

13) Where is linear searching used?

1 point

When the list has only a few elements

When performing a single search in an unordered list

Used all the time

When the list has only a few elements and When performing a single search in an unordered list

Other:

Clear selection

14) Which of the following is a disadvantage of linear search?

1 point

Requires more space

Greater time complexities compared to other searching algorithms

Not easy to impliment

Not easy to understand

Other:

Clear selection

15) def outerFun(a, b): def innerFun(c, d): return c + d return innerFun(a, b) res = outerFun(5, 10) print(res)

2 points

15

17

error

noneof these

Other: