Functional Programming Approaches Quiz

1. What is a pure function in functional programming?

• A pure function is one that depends on global variables and can lead to side effects in the program.
• A pure function is one that always causes a system error when given input and doesn`t return any output.
• A pure function is one that always returns the same output given the same input and does not produce any side effects, such as modifying global variables or performing I/O operations.
• A pure function can return different outputs for the same input and modifies global state as a side effect.

2. What does `immutability` mean in functional programming?

• It means data should be stored in a mutable manner.
• It means functions do not have side effects.
• It means data can be constantly changed.
• It means data cannot be modified after creation.

3. Which of the following is a key feature of functional programming?

• Mutable state
• Higher-order functions
• Side effects
• Object-oriented design

4. What is a higher-order function?

• A higher-order function is one that cannot take a function as an argument.
• A higher-order function is one that is defined outside any other function.
• A higher-order function is one that only returns a value.
• A higher-order function is one that can take other functions as arguments or return them as results.

5. In functional programming, what is a `side effect`?

• A side effect refers to a function that only performs calculations.
• A side effect is when a function is called without any parameters.
• A side effect occurs when a function modifies some state or interacts with the outside world.
• A side effect means a function`s output does not depend on its inputs.

6. What is `recursion` in functional programming?

• Recursion refers to functions that process data in a linear, sequential manner.
• Recursion is when a function creates new data structures iteratively without self-reference.
• Recursion is a method for optimizing global variable states in functions.
• Recursion is a technique in which a function calls itself to solve a problem, commonly used in functional programming to replace loops.

7. Which of the following is a common functional programming language?

• Python
• Haskell
• Java
• C++

8. What is `referential transparency` in functional programming?

• Referential transparency means that functions can modify global variables without issues.
• Referential transparency means that a function always returns the same result for the same input.
• Referential transparency means a function has no return value.
• Referential transparency allows functions to return different results based on external states.

9. Which of the following is discouraged in functional programming?

• Mutable state
• Global variables
• Side effects
• Infinite loops

10. What is `currying` in functional programming?

• Currying is a technique where a function with multiple arguments is transformed into a series of functions, each taking one argument.
• Currying is a method of optimizing performance by combining functions into one.
• Currying is a way to explicitly define global variables in programming.
• Currying refers to the process of converting strings to numbers in programming.

11. In functional programming, which statement is true about loops?

• In functional programming, loops have no place and cannot be used at all.
• In functional programming, loops are preferred over recursion for performance reasons.
• In functional programming, loops are typically replaced with recursion or higher-order functions like `map` and `reduce` to iterate over data structures.
• In functional programming, loops are the primary method for handling repetition.

12. Which of the following is an example of a higher-order function?

• filter
• sort
• reduce
• map

13. In functional programming, what does the map function do?

• The `map` function sorts elements in a list in ascending order.
• The `map` function merges two lists into one.
• The `map` function applies a given function to each element in a list and returns a new list with the transformed values.
• The `map` function filters elements from a list based on a condition.

14. What is `lazy evaluation` in functional programming?

• Lazy evaluation delays calculation until needed.
• Eager evaluation processes all at once.
• Immediate evaluation computes functions instantly.
• Forced evaluation executes all tasks at once.

15. What does the reduce function do in functional programming?

• The `reduce` function creates a new list from the original list.
• The `reduce` function divides a list into multiple smaller lists.
• The `reduce` function applies a function to each element sequentially and returns them.
• The `reduce` function applies a function cumulatively to the elements of a list, reducing the list to a single value (e.g., summing the elements).

16. Which of the following is a feature of functional programming?

• Iterative loops
• First-class functions
• Mutable states
• Side effects

17. What does `composition` refer to in functional programming?

• Function composition combines functions to create a new function.
• Composition refers to the order of function execution only.
• Function decomposition splits functions into smaller parts.
• Composition is the act of comparing two functions.

18. In functional programming, what does `partial application` mean?

• Partial application is a technique in which a function is applied to some of its arguments, producing a new function that takes the remaining arguments.
• Partial application means using a function solely for output without taking any input.
• Partial application creates a function that ignores all additional inputs and always returns the same output.
• Partial application involves breaking a function into smaller functions that cannot accept any parameters.

19. What is the primary benefit of using functional programming?

• Inability to use loops in programs.
• More predictable and testable code.
• Decreased performance and flexibility.
• Fewer tools for handling side effects.

20. What is the purpose of the `fold` function in functional programming?

• The `fold` function splits a list into two separate lists based on a condition.
• The `fold` function simply returns the size of a list without modifying its contents.
• The `fold` function is used to filter elements from a collection into a new list.
• The `fold` function takes an initial accumulator value and a combining function and builds its return value by consecutively combining the current accumulator value with each collection element.

21. What is the difference between `map` and `reduce` in functional programming?

• `map` is synchronous, while `reduce` is asynchronous.
• `map` can only handle numbers, while `reduce` can handle any data type.
• `map` returns a single value, while `reduce` returns a list of elements.
• `map` applies a function to each element, while `reduce` combines them into a single value.

22. What is the significance of first-class functions in functional programming?

• First-class functions are only applicable in object-oriented programming languages.
• First-class functions prevent the use of any other programming paradigm in code.
• First-class functions allow functions to be treated like any other value and passed around as arguments or returned from other functions.
• First-class functions can only be assigned to variables and cannot be passed as arguments.

23. What type of programming paradigm is characterized by avoiding mutable state?

• Procedural programming
• Object-oriented programming
• Functional programming
• Imperative programming

24. How does functional programming handle state changes compared to imperative programming?

• Imperative programming exclusively utilizes recursion to manage state changes effectively.
• Functional programming avoids functions and prioritizes manual state management in algorithms.
• Functional programming uses immutability and pure functions to handle state changes without side effects.
• Imperative programming relies on mutable state and direct variable updates for managing state changes.

25. What is the use of tail recursion in functional programming?

• To increase the execution speed of all functions
• To optimize memory usage by reducing call stack size
• To allow functions to take variable arguments
• To simplify variable scope management

26. Why is immutability important in functional programming?

• It helps prevent unintended state changes in programs.
• It allows functions to run more quickly.
• It makes code easier to read and write.
• It enables the use of global variables.

27. How can lazy evaluation improve performance in functional programming?

• Lazy evaluation executes all functions eagerly.
• Lazy evaluation avoids unnecessary computations.
• Lazy evaluation processes data in real-time only.
• Lazy evaluation focuses on mutable state changes.

28. What is an example of function composition in programming?

• Combining functions to create a new function
• Passing variables to a function
• Running a process in a loop
• Defining a single function library

29. How do functional programming languages typically handle error management?

• By throwing exceptions that stop program execution immediately.
• By using print statements to debug issues at runtime.
• By allowing global state changes to indicate errors.
• By using monads to handle errors without side effects.

30. What is an `anonymous function` in the context of functional programming?

• A type of recursive function that has no base case.
• A function that always returns a fixed value.
• A function that cannot be executed.
• A function without a name used for short tasks.