Explore topic-wise InterviewSolutions in Current Affairs.

There are 4 types of functions arguments.

There are 2 methods of arguments passing in variable length method.

A variable, with global scope can be used anywhere in the program. It can be created by defining a variable outside the scope of any function/block.

Method I using functions:

def lcm (x, y):

if x > y:

greater = x

else:

greater = y while (true):

if ((greater % x = = 0) and (greater % y = = 0)):

lcm = greater break

greater + = 1

return lcm

num 1 = int (input(“Enter first number : “))

num 2 = int (input(“Enter second number : “))

print (“The L.C.M of” , numl, “and” , num, “is” , lcm(num1, num2))

Method II

(without using functions)

a = int (input (“Enter the first number :”))

b = int (input (“Enter the second number :”))

if a > b:

mini = a

else:

min 1 = b

while(1):

if (min 1 % a = = 0 and mini 1 % b = = 0):

print (“LCM is:” , mini)

break

mini = min 1 + 1

Output:

Enter the first number: 15

Enter the second number: 20

LCM is: 60

Eval function is used to evaluate the input value.

Answer is (d) 65

Cell function returns the smallest integer greater than or equal to x

There are 3 format ( ) functions

Eval function is used to evaluate the input value.

Parameters or arguments can be passed to functions def function _ name (parameter (s) separated by comma):

Python recursive functions

When a function calls itself is known as recursion. Recursion works like loop but sometimes it makes more sense to use recursion than loop. You can convert any loop to recursion.

A recursive function calls itself. Imagine a process would iterate indefinitely if not stopped by some condition! Such a process is known as infinite iteration. The condition that is applied in any recursive function is known as base condition. A base condition is must in every recursive function otherwise it will continue to execute like an infinite loop.

Working Principle:

1. Recursive function is called by some external code.

2. If the base condition is met then the program gives meaningful output and exits.

3. Otherwise, function does some required processing and then calls itself to continue recursion. Here is an example of recursive function used to calculate factorial.

Example:

def fact (n):

if n = = 0:

return 1

else:

return n * fact (n – 1)

print (fact (0))

print (fact (5))

Output:

1

120

The condition that is applied in any recursive function is known as base condition. A base condition is must in every recursive function otherwise it will continue to execute like an infinite loop.

1. Recursive function is called by some external code.

2. If the base condition is met then the program gives meaningful output and exits.

3. Otherwise, function does some required processing and then calls itself to continue recursion

Python also allows you to change the limit using 

sys.setrecursionlimit (limit value).

Example:

import sys

sys.setrecursionlimit(3000)

def fact (n):

if n = = 0:

return 1

else:

return n * fact (n – 1)

print (fact (2000))

(a) Recursive function call itself