Professional Documents
Culture Documents
return largest
a = int(input("enter number 1 "))
b = int(input("enter number 2 "))
c = int(input("enter number 3 "))
res = maximum(a,b,c)
print("maximum ",res)
Python user define function program for practice
a,b=4,13
print(a,",",b)
fun(a,b) #calling
fun(a) #calling
fun(b) #calling
fun(b,a)
def chkprm(n):
c=0
for i in range(1,n+1):
if n%i==0:
c=c+1
if c==2:
return 1
else:
return -1
num = int(input("enter a number "))
res = chkprm(num)
print(res)
FUNCTION OUTPUT BASED QUESTIONS
def s(a, b):
a+=2
b*=5
print(a,":",b,"\n")
a,b=4,8
print(a,":",b,"\n")
s(a,b)
print(a,":",b,"\n")
def s(a,b):
a+=2
b[0]=b[0]+5
print(a,":",b,"\n")
a,b=4,[8]
print(a,":",b,"\n")
s(a,b)
FUNCTION OUTPUT BASED QUESTIONS
def s(a, b=7):
a+=2
b*=5
print(a,":",b,"\n")
a,b=4,8
print(a,":",b,"\n")
s(a,b)
print(a,":",b,"\n")
s(a)
print(a,":",b,"\n")
def execute(x,y=15):
temp=x+y
x+=temp
if(y<=20):
print(temp,",",x,",",y)
a,b =50,20
execute(b)
print(a,",",b)
execute(b)
print(a,",",b)
FUNCTION OUTPUT BASED QUESTIONS
def func(x,y=10):
if x%y==0 :
return x+2
else:
return y-1
p,q=20,23;
print(p,",",q)
q=func(p,q)
print(p,",",q)
def func(x,y=10):
if x%y==0 :
return x+2
else:
return y-1
p,q=20,23;
print(p,",",q)
q=func(p,q)
print(p,",",q)
p=func(q)
print(p,",",q))
PREDICT THE FLOW OF CONTROL/EXECUTION AND ALSO FIND THE OUTPUT
Flow of execution
1-5-9-10-5-6-1-2-3-6-7-10-1-2-3-10-11
Output:
52
Flow of execution
1-5-6-7-1-2-8
Output:
3
4
Python
EasyEasyEasy
SCHOOLbbbbCOM
FUNCTION OUTPUT BASED QUESTIONS
a=10
y=5
def myfun(a):
y=a
a=2
print(y,"@",a)
print(a+y)
return a+y
print(y,"@",a)
print(myfun(a))
print(y,"@",a)
a=10
y=5
def myfun(a):
global y
y=a
a=2
print(y,"@",a)
print(a+y)
return a+y
print(y,"@",a)
print(myfun(a))
print(y,"@",a)
What is Recursion?
The process in which a function calls itself directly or indirectly is
called recursion and the corresponding function is called as
recursive function. Using recursive algorithm, certain problems can
be solved quite easily.
return n*recur_factorial(n-1)
return n+funsum(n-1)
def recur_fibo(n):
if n <= 1:
return n
else:
return(recur_fibo(n-1) + recur_fibo(n-2))
def f5(s):
s1=''
for i in range(len(s)):
if s[i]==s[-1-i]:
s1+=s[i]
else:
s1=s[i]+s1
print(s1)
f5('abcba')
f5('abcaba')
def f4(s): FUNCTION OUTPUT BASED QUESTIONS
for ch in s:
if ch in 'aeiou':
print('*',end='')
elif ch in ['AEIOU']:
print('#',end='')
elif ch.isdigit():
print(s[0],end='')
else:
print(s[-1],end='')
f4('India91')
print()
f4('KUwait965')
def f2(x,y):
global b
x+=b
b*=y
y+=x+y
print(x,y,b)
x,b=5,10
f2(x,b)
print(x,b)