function_name()
call function_name()
ret function_name()
function function_name()
datetime
date
time
timedate
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 the following Python code?
def foo(x): x = ['def', 'abc'] return id(x)q = ['abc', 'def']print(id(q) == foo(q))
True
False
None
Error
Lists
Dictionary
String
All of the mentioned
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
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
reverse(l)
list(reverse[(l)])
reversed(l)
list(reversed(l))
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
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
strptime()
strftime()
Both A and B
None of the above
A function that calls other function.
A function which calls itself.
Segments
Modules
Units
All the above
What is the output of the following?
x=123for i in x: print(i)
1 2 3
123
none of these
Heap
Stack
Uninitialized data segment
Subroutines
Function
Definition
Parameters
def function function_name():
declare function function_name():
def function_name():
declare function_name():
function
def
fun
define
(x**y)**z
(x**y) / z
(x**y) % z
(x**y)*z
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
;
: :
:
%
procedure
bug
None of these
In Module
In Class
In Another function
All of these
0
Null
Arbitary value
factorial()
print()
seed()
sqrt()
int
bool
void
Arguments
What is the output of this code?
def calc(x): r=2*x**2 return rprint(calc(5))
50
100
20
One
Two
Three
Any Number of Times
What will be the output of the following Python function?
len(["hello",2, 4, 6])
4
3
6
def s(n1): print(n1) n1=n1+2n2=4s(n2)print(n2)
6 4
4 6
4 4
6 6
User Defined Function
Library Functions
Builtin Functions
All of the above
example = "helle" print(example.rfind("e"))
1
2
5
def foo(): return total + 1total = 0print(foo())
error
none of the mentioned
What will be the output of the following python program?
def addItem(listParam): listParam+=[1]mylist=[1,2,3,4]addItem(mylist)print(len(mylist))
8
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))
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
What is the return type of following function ?
def func1(): return 'mnp',22print(type(func1()))
List
Tuple
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
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
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)
import mathprint(abs(math.sqrt(25)))
-5
5.0
A static variable
A global variable
A local variable
An automatic variable
Choose the correct function declaration of fun1() so that we can execute the following two function calls successfully.
fun1(25, 75, 55)fun1(10, 20)
def fun1(**kwargs)
def fun1(args*)
No, it is not possible in Python
def fun1(*data)
def foo(k): k[0] = 1 q = [0] foo(q) print(q)
[0]
[1]
[1, 0]
[0, 1]
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
none
x='abcd'for i in x: print(i.upper())
a BCD
abcd
A B CD