Deck 3: Functional Programming

Question 1

In Scheme,a let special form can be used to define a recursive function.

Answer 1

False

Question 2

Scheme expressions must be written in prefix form.

Answer 2

True

Question 3

The semantics of Scheme uses static type checking.

Answer 3

False

Question 4

Scheme expressions that begin with keywords are called control forms.

Question 5

The ML programming language is strongly typed.

Question 6

The simplest unit of syntax in Scheme is called an atom.

Question 7

A function that takes other functions as parameters or returns a function as a value is called a recursive function.

Question 8

A function definition describes how a value is to be computed using formal parameters.

Question 9

A pure functional program is one that consists only of functions and procedures.

Question 10

In the ML programming language,a function is declared using the lambda keyword.

Question 11

hd is the predefined list function that returns the head of a list in Scheme.

Question 12

With static scoping,the meaning of a variable depends on the runtime context.

Question 13

The rand function is referentially transparent.

Question 14

The if form in Scheme is like an if-else construct.

Question 15

A function application is a call to a defined function using actual parameters.

Question 16

The ML programming language has a built-in list reverse function called rev.

Question 17

A language is considered to be fully curried if function definitions are treated as curried and if all multiparameter built-in functions are curried.

Question 18

A Scheme compiler will translate a tail recursive function into code that executes as a loop.

Question 19

In Scheme,the letrec form makes a global binding of a variable visible in the top-level environment.

Question 20

In ML,arithmetic operators are written as infix operators.

Question 21

Which of the following represents a list in ML?

A) (1 2 3)
B) {1 2 3}
C) [1, 2, 3]
D) (1, 2, 3)

Question 22

Which of the following Scheme statements will insert the number 6 at the head of a list named L?

A) (add 6 L)
B) (insert 6 L)
C) (hd 6 L)
D) (cons 6 L)

Question 23

To express symbols as a data type in Scheme,use the keyword ____.

A) symbol
B) form
C) quote
D) exclamation

Question 24

What is the purpose of a binding list in Scheme?

A) It creates a function.
B) It marks an expression for delayed evaluation.
C) It binds variable names to values.
D) It specifies a list of parameters for a function.

Question 25

Which of the following correctly assigns values to two variables and then multiplies them in the Scheme programming language?

A) (let ((x 5) (y 3)) (* x y))
B) (let (x 5) (y 3)) (* x y)
C) let (x 5) (y 3) (* x y)
D) (let (x 5 y 3) (* x y))

Question 26

Which of the following statements about functional programming languages is incorrect?

A) In pure functional programming, there are no assignments.
B) In pure functional programming, there are no loops.
C) In pure functional programming, loops are replaced by recursive calls.
D) The value of a function depends on the order of evaluation of its parameters.

Question 27

Which of the following represents a list of data in Scheme?

A) (3.1, 3.2, 3.3)
B) (3.1; 3.2; 3.3)
C) (quote (3.1 3.2 3.3))
D) (quote (3.1, 3.2, 3.3))

Question 28

To define a value in the ML programming language,use the ____ keyword.

A) define
B) let
C) letrec
D) val

Question 29

To determine if two lists have the same fringe,we must flatten them to just lists of their atoms.

Question 30

Which of the following statements about Scheme is correct?

A) Scheme function applications use pass by value, while special forms in Scheme use delayed evaluation.
B) Scheme function applications use pass by name, while special forms in Scheme use delayed evaluation.
C) Scheme special forms use pass by value, while function applications in Scheme use delayed evaluation.
D) Scheme special forms use pass by value, while function applications in Scheme use delayed evaluation.

Question 31

The Haskell language requires semicolons and bracketing to resolve ambiguities.

Question 32

Given a list L in Scheme with contents of (3 7 2 8).What will be returned if the command (cdr L)is executed?

A) (8)
B) (3)
C) (2 8)
D) (7 2 8)

Question 33

The essential construct of lambda calculus is called the lambda application.

Question 34

The definition of a language using an interpreter written in the same language is called a ____.

A) metaphysical interpreter
B) metaphysical interpreter
C) metaphorical interpreter
D) metacircular interpreter

Question 35

Given a list L in Scheme with contents of ((x y)s (t)).What will be returned if the command (cdr (car L))is executed?

A) (x)
B) (y)
C) (x y)
D) (t)

Question 36

Haskell supports a type class inheritance through a hierarchy of type classes.

Question 37

Lists that obey lazy evaluation are called serialized lists.

Question 38

The Scheme evaluation rule represents ____ evaluation.

A) applicative order
B) normal order
C) binary order
D) sequential order

Question 39

Which of the following statements about scoping in Scheme is correct?

A) A bound variable is a variable referenced within a function that is not also a formal parameter to that function.
B) A free variable is a variable within a function that is also a formal parameter to that function.
C) A free variable is a variable referenced within a function that is not also a formal parameter to that function.
D) A free variable is one that is bound within a nested function.

Question 40

The ____ is used in Scheme to create a function.

A) let special form
B) letrec special form
C) lambda special form
D) procedure special form

Question 41

In lambda calculus,a conversion that allows for the elimination of redundant lambda abstractions is call ____.

A) eta-conversion
B) alpha-conversion
C) beta-conversion
D) beta-abstraction

Question 42

In lambda calculus,a value can be substituted for a variable by use of a(n)____.

A) reduction rule
B) evaluation rule
C) abstraction rule
D) application rule

Question 43

If the ML command val h::t = [4 5 6]; is executed,what value will t have?

A) [1]
B) [2]
C) [1 2]
D) [2 3]

Question 44

The ____ character in ML indicates a wildcard.

A) hyphen
B) asterisk
C) question mark
D) underscore

Question 45

Standard predefined resources for performing input and output in ML are contained in a ____.

A) package
B) library
C) class
D) structure

Question 46

Which of the following statements is correct?

A) A language with nonstrict functions is easier to implement.
B) A function that will produce well-defined results, even when subexpressions or parameters may be undefined, is said to be strict.
C) Delayed execution can lead to well-defined results, even when subexpressions or parameters may be undefined.
D) Nonstrictness is always an undesirable property in a language.

Question 47

Which of the following statements about lazy evaluation is incorrect?

A) Operations on lists must evaluate the entire list.
B) All arguments to user-defined functions are delayed.
C) All arguments to constructor functions are delayed.
D) All bindings of local names in let and letrec expressions are delayed.

Question 48

Which of the following statements about Haskell is correct?

A) Haskell is a lazy language that is not fully curried.
B) Haskell is a fully curried language that does not do delayed evaluation.
C) Haskell is a fully curried and lazy language.
D) Haskell does not support higher-order functions.

Question 49

In the Haskell language,the ____ character represents the lambda.

A) backslash
B) underscore
C) vertical bar
D) ampersand

Question 50

The ____ character is used for alternative values in the ML programming language.

A) underscore
B) vertical bar
C) ampersand
D) percent sign