COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
mapping from one set of values to another, where the input to the function will always return an output
|
|
|
transparency of the methods used, where the user can change the properties of the function
|
|
|
user being able to adjust the way the function processes the data, improving the overall efficiency
|
|
|
way functions can be daisy-chained and catch any exceptions internally, preventing and program crashes
|
Detailed explanation-1: -In computer science, functional programming is a programming paradigm where programs are constructed by applying and composing functions.
Detailed explanation-2: -Bugs-Free Code As FP Languages do not support state, they don’t raise any side-effects that means we can write Error-free code or Bugs-free code or Less Error-prone Code.-Efficient Parallel Programming As FP Languages have NO Mutable state, they don’t raise any state-change issues.
Detailed explanation-3: -Functional programming is used in languages like Lisp, Haskell, and Scala. The main difference between imperative and functional languages is that functions that are evaluated are the main way of gaining and transforming data, functional programming is stateless.
Detailed explanation-4: -Previous Page. Functional interfaces have a single functionality to exhibit. For example, a Comparable interface with a single method ‘compareTo’ is used for comparison purpose. Java 8 has defined a lot of functional interfaces to be used extensively in lambda expressions.