Question 1

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)

Accepted Answer

In ML, lists are represented using square brackets, with elements separated by commas. Therefore, option C [1, 2, 3] represents a list in ML. Option A is a tuple, which is also used in ML but is represented using parentheses instead of square brackets. Option B is a set, which is another data structure in ML but is represented using curly braces. Option D is another tuple, but it uses parentheses instead of square brackets.

Question 2

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)

Accepted Answer

The Scheme statement (cons 6 L) creates a new list with the number 6 as the first element and L as the rest of the elements, effectively inserting 6 at the head of the list.

Question 3

To express symbols as a data type in Scheme,use the keyword ____.
A) symbol
B) form
C) quote
D) exclamation

Accepted Answer

In Scheme, symbols are expressed using the keyword `quote` or its shorthand `'` to prevent them from being evaluated.

Question 4

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.

Accepted Answer

A binding list in Scheme is used to associate or bind variable names to values, allowing those names to be used to refer to the bound values within a given scope.

Question 5

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))

Accepted Answer

Option A uses the correct syntax for assigning values to two variables using let, and then multiplying them using the * operator.

Question 6

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.

Accepted Answer

In functional programming languages, the value of a function does not depend on the order of evaluation of its parameters. This is known as referential transparency, which means that a function will always return the same output for the same input, regardless of when it is evaluated or how many times it is evaluated.

Question 7

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))

Accepted Answer

In Scheme, lists are represented within parentheses and can contain any type of values. Option A is using commas instead of spaces to separate the values, which is not valid syntax. Option B is using semicolons instead of commas or spaces, which is also not valid syntax. Option D is using commas within the parentheses, which is also not valid syntax. Option C correctly uses the quote function to create a list containing the values 3.1, 3.2, and 3.3.

Question 8

To define a value in the ML programming language,use the ____ keyword.
A) define
B) let
C) letrec
D) val

Accepted Answer

In the ML programming language, the `val` keyword is used to define a value.

Question 9

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

Accepted Answer

The fringe of a tree is the list of all nodes in the tree that do not have any children. Therefore, when comparing the fringes of two trees, we need to only consider the atoms of the nodes in the fringe. In order to do so, we must flatten the trees into lists of atoms.

Question 10

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

Accepted Answer

Scheme function applications indeed use pass by value (also known as applicative order evaluation), where the arguments to functions are evaluated before the function is applied. Special forms in Scheme, such as if or define, use delayed evaluation (also known as normal order evaluation) where the evaluation of arguments is delayed until their values are actually needed. This allows for constructs like conditional expressions to work without evaluating all branches.

Question 11

The Haskell language requires semicolons and bracketing to resolve ambiguities.

Accepted Answer

Haskell does not require semicolons and bracketing to resolve ambiguities. Instead, it uses indentation to indicate blocks of code, making the code more readable and avoiding the need for explicit bracketing.

Question 12

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)

Accepted Answer

The cdr function in Scheme returns the "rest" of the list, excluding the first element. So, for the list (3 7 2 8), (cdr L) would return (7 2 8).

Question 13

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

Accepted Answer

The essential construct of lambda calculus is actually the lambda abstraction, which represents an anonymous function. The lambda application is an operation for applying a lambda abstraction to an argument.

Question 14

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.

Accepted Answer

The definition described in the question is that of a metacircular interpreter, which is an interpreter for a programming language that is written in the same language it interprets.

Question 15

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)

Accepted Answer

The command (cdr (car L)) first takes the car (first element) of L, which is (x y), and then takes the cdr (all elements after the first) of that, which results in (y).

Question 16

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

Accepted Answer

Haskell allows for type classes to inherit from other type classes, creating a hierarchy. This hierarchy is similar to traditional class inheritance in object-oriented programming.

Question 17

Lists that obey lazy evaluation are called serialized lists.

Accepted Answer

Lists that obey lazy evaluation are called lazy lists, not serialized lists.

Question 18

The Scheme evaluation rule represents ____ evaluation.
A) applicative order
B) normal order
C) binary order
D) sequential order

Accepted Answer

Scheme uses applicative order evaluation, which means that the arguments to a function are evaluated before the function itself is called.

Question 19

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.

Accepted Answer

In Scheme, a free variable is a variable referenced within a function that is not also a formal parameter to that function. A bound variable, on the other hand, is a variable that is either a formal parameter to the function or has been locally bound by a let or lambda expression. Therefore, the correct statement about scoping in Scheme is that a free variable is a variable referenced within a function that is not also a formal parameter to that function.

Question 20

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

Accepted Answer

The lambda special form is used to create a function in Scheme. It allows for the definition of an anonymous function with parameters and a body, which be assigned to a variable or called as a procedure. The let and letrec special forms are used to create local bindings of variables, but do not define functions. The procedure special form is not a valid term in Scheme.

Quiz 3: Functional Programming

Which of the following represents a list in ML?

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

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

What is the purpose of a binding list in Scheme?

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

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

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

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

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

Which of the following statements about Scheme is correct?

The Haskell language requires semicolons and bracketing to resolve ambiguities.

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

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

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

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?

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

Lists that obey lazy evaluation are called serialized lists.

The Scheme evaluation rule represents ____ evaluation.

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

The ____ is used in Scheme to create a function.