(x**y)**z
(x**y) / z
(x**y) % z
(x**y)*z
What is the return type of following function ?
def func1(): return 'mnp',22print(type(func1()))
List
Dictionary
String
Tuple
def fun (a = 2, b = 3, c)
def fun(a = 2, b, c = 3)
def fun(a, b = 2, c = 3)
def fun(a, b, c = 3, d)
What will be the output of following?
Y=[2,5J,6]Y.sort()
[2,6,5J]
[5J,2,6]
Error
[6,5J,2]
What will be the output of the following?
def iq(a,b): if(a==0): return b else: return iq(a-1,a+b)print(iq(3,6))
9
10
11
12
Program gets into an infinite loop
Program runs once
Program runs n number of times where n is the argument given to the function
An exception is thrown
What will be the output of the following Python code?
def foo(k): k[0] = 1 q = [0] foo(q) print(q)
[0]
[1]
[1, 0]
[0, 1]
What is the output of the following?
x=123for i in x: print(i)
1 2 3
123
none of these
def function function_name():
declare function function_name():
def function_name():
declare function_name():
A function that calls itself
A function execution instance that calls another execution instance of the same function
A class method that calls another class method
An in-built method that is automatically called
How many numbers will be printed by the following code?
def fun(a,b): for x in range(a,b+1): if x%3==0: print(x,end=" ")fun(100,120)
7
8
6
seed()
sqrt()
factorial()
print()
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
strptime()
strftime()
Both A and B
None of the above
What is the output of this code?
def calc(x): r=2*x**2 return rprint(calc(5))
50
100
20
Lists
All of the mentioned
function
def
fun
define
reverse(l)
list(reverse[(l)])
reversed(l)
list(reversed(l))
def foo(): return total + 1total = 0print(foo())
0
1
error
none of the mentioned
int
null
None
An exception is thrown without the return statement
What will be the output of the following Python function?
import mathprint(abs(math.sqrt(25)))
-5
5
5.0
datetime
date
time
timedate
What will be the output of the following code snippet?
numbers = (4, 7, 19, 2, 89, 45, 72, 22)sorted_numbers = sorted(numbers)odd_numbers = [x for x in sorted_numbers if x% 2!=0]print(odd_numbers)
[7, 19, 45, 89]
[2, 4, 22, 72]
[4, 7, 19, 2, 89, 45, 72, 22]
[24, 7, 19, 22, 45, 72, 89]
Subroutines
Function
Definition
Parameters
Every recursive function must have a base case
Infinite recursion can occur if the base case isn’t properly mentioned
A recursive function makes the code easier to understand
Every recursive function must have a return value
sum(2,4,6)sum([1,2,3])
Error, 6
12, Error
12, 6
Error, Error
What is the output of the following code?
x = 50def func (x): x = 2func (x)print ('x is now', x)
x is now 50
x is now 2
x is now 100
A static variable
A global variable
A local variable
An automatic variable
What is the output of the following code ?
def add(a, b): return a+5, b+5result = add(3,2)print(result)
15
(8,7)
break
pass
continue
What is the output of the following
y='klmn'for i in range(len(y)): print(y)
klmn klmn klmn klmn
k
kkk
None of the these
One
Two
Three
Any Number of Times
2
none
;
: :
:
%
What will be the output of the following Python code ?
def display(b,n): while n>0: print(b,end='') n=n-1display('z',3)
zzz
zz
Infinite loop
A built-in Python function
A one-line anonymous function
Lambda is a function in python but user can not use it.
find the output of following code:
def add(a,b): return(a+b)print(add(3,4))
4
built-in functions
user-defined functions
py function
def foo(): total += 1 return totaltotal = 0print(foo())
What is the output of below program ?
def say(message, times =1): print(message * times)say("Hello")say("Word",5)
Hello WordWordWordWordWord
Hello Word 5
Hello Word,Word,Word,Word,Word
Hello HelloHelloHelloHelloHello
from math import factorialprint(math.factorial(5))
120
Nothing is printed
NameError: name 'math' is not defined
Error, the statement should be print factorial(5))
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
example = "helle" print(example.rfind("e"))
It’s easier to code some real-world problems using recursion than non-recursive equivalent
Recursive functions are easy to debug
Recursive calls take up a lot of memory
Programs using recursion take longer time than their non-recursive equivalent
len(["hello",2, 4, 6])
3
function_name()
call function_name()
ret function_name()
function function_name()
Making the code look clean
A complex task can be broken into sub-problems
Recursive calls take up less memory
Sequence generation is easier than a nested iteration
Arguments