Python Functions

What is a function in Python?

• A function in Python is a type of data structure

• A function in Python is a block of organized, reusable code that is used to perform a single, related action.

• A function in Python is used to display text on the screen

• A function in Python is a keyword used to define a variable

What are parameters in a function?

• Parameters in a function are the variables that are used to store the output values of the function.

• Parameters in a function are the variables that are used to receive input values when the function is called.

• Parameters in a function are the data types used to declare the function.

• Parameters in a function are the comments added to explain the purpose of the function.

What are arguments in a function?

• Arguments in a function are the names of the function

• Arguments in a function are the comments within the function

• Arguments in a function are the values that are passed to the function when it is called.

• Arguments in a function are the values that are returned by the function

What is the purpose of the return statement in a function?

• To declare a new variable

• To print a message to the console

• To specify the value that the function should return to the caller.

• To stop the execution of the function

How do you call a function in Python?

• By using the function name followed by square brackets

• By using the function name followed by brackets

• By using the function name followed by parentheses

• By using the function name followed by curly braces

What is recursion in Python?

• Recursion in Python is a way to create random numbers in a program

• Recursion in Python is a type of loop that iterates through a list of elements

• Recursion in Python is a programming technique where a function calls itself to solve a problem.

• Recursion in Python is a method for importing external libraries into a program

Give an example of a recursive function in Python.

• def factorial(n): if n == 0: return 1 else: return n * factorial(n-1)

• def sum_list(arr): if len(arr) == 1: return arr[0] else: return arr[0] + sum_list(arr[1:])

• def power(base, exp): if exp == 0: return 1 else: return base * power(base, exp-1)

• def fibonacci(n): if n <= 1: return n else: return(fibonacci(n-1) + fibonacci(n-2))

What is the base case in recursion?

• The base case in recursion is the condition that stops the recursive calls and allows the function to start returning values.

• The base case in recursion is the condition that increases the recursive calls

• The base case in recursion is the condition that changes the data type of the function

• The base case in recursion is the condition that allows the function to skip the recursive calls

What are the advantages and disadvantages of using recursion in Python?

• The advantages of using recursion in Python include elegant and concise solutions to certain problems, while the disadvantages include potential stack overflow errors and less efficient memory and time complexity.

• The advantages of using recursion in Python include better error handling and improved modularity, while the disadvantages include difficulty in understanding and higher learning curve.

• The advantages of using recursion in Python include improved code readability and easier debugging, while the disadvantages include limited applicability and slower performance.

• The advantages of using recursion in Python include faster execution and better memory management, while the disadvantages include longer code and increased complexity.