week 1

Question 1

Briefly describe the imperative programming paradigm

Answer 1

memory + assignment + control structures

how

Question 2

Briefly describe the functional programming paradigm

Answer 2

function application
(How)

Question 3

Give the definition of add 1, using lambda calculus

Answer 3

add_one(x) = \x.(x+1)
add_one(3) = (\x.(x+1))(3)

Question 4

what does pure mean in programming paradigms?

Answer 4

no side effects

Question 5

how do side effects occur?

Answer 5

via assignments (state changes) and many imperative structures

Question 6

Define polymorphic types

Answer 6

functions with a generic type

Question 7

describe type inference

Answer 7

no type annotation, the computer can work out the type statically at compile time

Question 8

write the quicksort algorithm in Haskell

Answer 8

qsort[] = []
qsort(x : xs) =qsort smaller ++ [x] ++ qsort larger
where
smaller = [ a | a x]

Question 9

describe functional programming in a restricted sense

Answer 9

programming without mutable variables, assignments, loops and other imperative control structures

Question 10

what is a function in functional programming?

Answer 10

values that are produced, consumed, and composed

Question 11

when we say imperative programming focuses on WHAT, what is the WHAT?

Answer 11

describing inputs, outputs, and the I/O relationships