Home Library Explore SAT

Home Library Explore SAT

Functional programming (TAP 6) Flashcards | StudBud

Explore/Functional programming (TAP 6)

reduce ff default (front : rest)= ff front ( reduce ff default rest)

Closures in Java finally map to

Functional programming (TAP 6)

10 terms·StudBud Administration·263 plays

Functional programming basic concepts

Flashcards10 cardsFPractice quizPHost liveL

Questions 10

Answers

1
Closures in Java finally map to
Map
Classes
Interfaces
Lists
2
reduce ff default (front : rest)= ff front ( reduce ff default rest)
direct recursion
stack recursion
back recursion
tail recursion
3
The declaration of the function parameter of filter is
T=>Boolean
(T,T)=>T
T=>T
(T,T)=>Boolean
4
The declaration of reduce is
List[T] T->Boolean => List[T]
List[T] T->T => List[T]
List[T] (T,T)->T => List[T]
List[T] (T,T)->T => T
5
How would you create a function from other function ?
Using type inference
using a higher order function
Using stack recursion
Using partial parametrization
6
In Java, functions
are first-class citizens
are not first-class citizens
are forbidden
7
map f x:xs = f x : map f xs. This function uses
stack recursion
direct recursion
tail recursion
partial recursion
8
Type inference is used
in all languages
only in functional languages
only in dynamically typed languages
in staticly typed languages
9
xsum (x:xs, total) = xsum (xs, x+total)
direct recursion
tail recursion
stack recursion
base recursion
10
Stack recursion is
as efficient as tail recursion
less efficient than tail recursion
more efficient than tail recursion