4.3. Functional Programming Paradigm

Try these first

1. 1.

   Define a pure function and provide an example.

   Hint

   Consider functions in mathematics that yield the same result regardless of external factors.

2. 2.

   What is immutability?

   Hint

   Think about variables in programming languages that cannot change value.

3. 3.

   What does a pure function do?

   • It can change state
   • It always produces the same output for the same input
   • It must use loops

   Hint

   Consider the characteristics that distinguish pure functions from others.

4. 4.

   True or False: Higher-order functions can take functions as arguments.

   • True
   • False

   Hint

   Think about functions that operate on other functions.

5. 5.

   Write a Haskell function using recursion to find the maximum value in a list.

   Hint

   Consider how breaking down the problem leverages the base case.

6. 6.

   In what ways do higher-order functions facilitate code reuse? Provide an example.

   Hint

   Think about how functions can operate on other functions to provide flexibility.