find the output of following code:
def add(a,b): return(a+b)print(add(3,4))
4
7
9
8
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
Error
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
The variables used inside function are called local variables.
The local variables of a particular function can be used inside other functions, but these cannot be used in global space.
The variables used outside function are called global variables.
In order to change the value of global variable inside function, keyword global is used.
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 is the output of the following code ?
def add(a, b): return a+5, b+5result = add(3,2)print(result)
15
(8,7)
What is the output of this code?
def calc(x): r=2*x**2 return rprint(calc(5))
50
100
20
procedure
function
bug
None of these
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
def disp(*arg): for i in arg: print(i)disp(name="Rajat", age="20")
TypeError
Rajat 20
Name age
Required arguments
Keyword arguments
Default arguments
Variable-length arguments
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))
10
11
12
fun
def
define
One
Two
Three
Any Number of Times
built-in functions
user-defined functions
py function
None of the above
None
0
Null
Arbitary value
def function function_name():
declare function function_name():
def function_name():
declare function_name():
Segments
Modules
Units
All the above
Subtracting two numbers
Comparing two data values
Providing output to the user
Adding two numbers
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 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
A static variable
A global variable
A local variable
An automatic variable
def s(n1): print(n1) n1=n1+2n2=4s(n2)print(n2)
6 4
4 6
4 4
6 6
A built-in Python function
A one-line anonymous function
Lambda is a function in python but user can not use it.
What is the value of the following Python code?
>>>print(36 / 4)
9.0
4.0
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]
Heap
Stack
Uninitialized data segment
def foo(k): k[0] = 1 q = [0] foo(q) print(q)
[0]
[1]
[1, 0]
[0, 1]
(x**y)**z
(x**y) / z
(x**y) % z
(x**y)*z
What is the output of the following?
x=123for i in x: print(i)
1 2 3
123
none of these
seed()
sqrt()
factorial()
print()
Subroutines
Function
Definition
Parameters
def foo(): return total + 1total = 0print(foo())
1
error
none of the mentioned
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)
6
What will be the output of the following Python function?
len(["hello",2, 4, 6])
3
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
def foo(): total += 1 return totaltotal = 0print(foo())
def foo(fname, val): print(fname(val))foo(max, [1, 2, 3])foo(min, [1, 2, 3])
3 1
1 3
strptime()
strftime()
Both A and B
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
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
What is the return type of following function ?
def func1(): return 'mnp',22print(type(func1()))
List
Dictionary
String
Tuple
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))
Lists
All of the mentioned
User Defined Function
Library Functions
Builtin Functions
All of the above
In Module
In Class
In Another function
All of these
;
: :
:
%
def fun(a, b=6): a=a+b print(a)fun(5, 4)
5