Heap
Stack
Uninitialized data segment
None of the above
Required arguments
Keyword arguments
Default arguments
Variable-length arguments
Repeating a process in a loop
Calling a function from within itself
Using a loop to iterate over elements
Breaking down a problem into smaller subproblems
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]
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
strptime()
strftime()
Both A and B
What is the output of the following?
x=123for i in x: print(i)
1 2 3
123
Error
none of these
def foo(): total += 1 return totaltotal = 0print(foo())
0
1
error
none of the mentioned
What will be the output of the following Python function?
sum(2,4,6)sum([1,2,3])
Error, 6
12, Error
12, 6
Error, Error
2
none
x='abcd'for i in x: print(i.upper())
a BCD
abcd
A B CD
Subroutines
Function
Definition
Parameters
function_name()
call function_name()
ret function_name()
function function_name()
(x**y)**z
(x**y) / z
(x**y) % z
(x**y)*z
What is the output of the following code ?
def disp(*arg): for i in arg: print(i)disp(name="Rajat", age="20")
TypeError
Rajat 20
Name age
None of these
Define keyword in python
Define variable in python
Define function in python
All of the above
What is the return type of following function ?
def func1(): return 'mnp',22print(type(func1()))
List
Dictionary
String
Tuple
None
Null
Arbitary value
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
built-in functions
user-defined functions
py function
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
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)
In Module
In Class
In Another function
All of these
function
def
fun
define
int
bool
void
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
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
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))
datetime
date
time
timedate
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
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
null
An exception is thrown without the return statement
What will be the output of following?
Y=[2,5J,6]Y.sort()
[2,6,5J]
[5J,2,6]
[6,5J,2]
A static variable
A global variable
A local variable
An automatic variable
seed()
sqrt()
factorial()
print()
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
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]
What will be the output of the following Python expression?
print(round(4.5676,2))
4.5
4.6
4.57
4.56
len(["hello",2, 4, 6])
4
3
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)
User Defined Function
Library Functions
Builtin Functions
Lists
All of the mentioned
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
Subtracting two numbers
Comparing two data values
Providing output to the user
Adding two numbers
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
A function that calls other functions
Both (A) and (B)
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
-1
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.