functional programming

Question 1

programming paradigm

Answer 1

is a style of computer programming. different programming languages support tackling problems in different ways.

Question 2

procedural programming

Answer 2

is supported by languages such as python or pascal, which have a series of instructions that tell the computer what to do with the input in order to solve the problem.
widely used in educational environments, being relatively easy to learn and applicable to w ide variety of problems

Question 3

structured programming

Answer 3

is a type of procedural programming which uses the programming constructs of sequence, selection, iteration and recursion. it uses modular techniques to split large programs into manageable chunks.

Question 4

object oriented programming

Answer 4

is supported by languages such as java, python and delphi. OOP was developed to make it possible to abstract details of implementation away from the user, make code reusable and programs easy to maintain. it is to a great extent taking over from procedural memory.

Question 5

declarative programming

Answer 5

is supported by languages such as SQL, where you write statements that describe the problem to be solved, and the language implementation decides the best way of solving it. SQL is used to query databases.

Question 6

functional programming

Answer 6

is supported by programming languages such as haskell, as well as python, c# and java. functions not objects or procedures, are used as the fundamental building blocks of a program. statements are written as a series of functions which accept input data as arguments and return an output.

Question 7

domain

Answer 7

a set from the functions input values are chosen

Question 8

co-domain

Answer 8

a set from which the functions output values are chosen

Question 9

arguement

Answer 9

is a value or expression passed to a function

Question 10

parameter

Answer 10

is a reference declared in function declaration

Question 11

function application

Answer 11

the process of giving particular inputs to a function

Question 12

first-class objects

Answer 12

is an object which may:
- appear in expressions
- be assigned to a variable
- be assigned as an argument
- be returned in a functional call

e.g. integers, floating point values, characters and strings. functions are also first-class objects so may themselves be passed as arguments

Question 13

stateless

Answer 13

in a functional programming language, the value of a variable cannot change. variables are said to be immutable.

Question 14

no side affects

Answer 14

the only thing a function is calculate something and return a result, and it is said to have no side effects

Question 15

referential transparency

Answer 15

a consequence of not being able to change the value of an object is that a function that is called twice with the same parameters will always return the same result.
makes it relatively easy for programmers to write correct, bug-free programs

Question 16

composition of functions

Answer 16

the combination of two functions to produce a new function that performs the two functions in a specified order

Question 17

types

Answer 17

sets of values

Question 18

typeclasses

Answer 18

sets of types

Question 19

high order function

Answer 19

is one which either takes a function as an argument or returns a function as a result, or both

Question 20

partial function application

Answer 20

decomposing multi-argument functions into smaller functions with fewer arguments

Question 21

map

Answer 21

a high order function that applies a given function to each element of a list, returning a list of results

Question 22

list

Answer 22

is a collection of elements which can be written in square brackets, e.g. [3, 7, 5, 8].
the empty list is written [].

Question 23

filter

Answer 23

a high order function which takes a predicate (to define a boolean condition) and a list. this returns the elements within the list that satisfy the boolean condition

Question 24

fold/reduce

Answer 24

a high order function which reduces a list of values to a single value, using recursion - by repeatedly applying a combination function to the list values.

Question 25

prepending

Answer 25

adding an element to the front of a list

Question 26

appending

Answer 26

adding an element to the end of a list

Question 27

immuatable

Answer 27

an objects state can never be changed

Question 28

head-tail representation

Answer 28

a method of representing a list in two parts: a head which is the first element of the list, and a tail is the remainder elements of a list

Question 29

big data

Answer 29

an umbrella term used to refer to typically unstructured datasets that are large in terms of size, velocity, variety,

Question 30

volume

Answer 30

to big to fit on a single server

Question 31

velocity

Answer 31

milliseconds or seconds to respond, particularly with streamed data

Question 32

varierty

Answer 32

the data may be in many forms such as structured, unstructured, text or multimedia

Question 33

big data analysis and processing

Answer 33

enables us to detect and analyse relationships within and among individual pieces of information that previously we were unable to grasp

Question 34

examples of big data

Answer 34

• healthcare
• google
• amazon

Question 35

writing correct code

Answer 35

• functional languages have no side effects:
  a function is said have a side effect if it modifies the state of the calling program in some way.
• functional programming languages support higher order functions:
  a higher order function is one which does at least one of the following
  
  • take one or more functions as input
  • outputs a function
    e.g. map function
• functional programming languages forbid assignment:
  in a functional programming language such as haskell, you cannot write statement as the property is known as immutability. an immutable object is one whose state cannot be modified after it is created.

Question 36

why is it important for processing across many servers?

Answer 36

it makes parallel processing extremely easy, because the same function always returns the same result

Question 37

fact based model

Answer 37

a data model consisting of facts such that each fact captures a single piece of information

Question 38

graph schema

Answer 38

a data model where the structure of a database is defined in terms of does, edges and properties.

Question 39

edges (graph schema)

Answer 39

the representation of a relationship between entities

Question 40

nodes (graph schema)

Answer 40

the representation of an entity

Question 41

properties (graph schema)

Answer 41

the representation of attributes and information stored with each entity