M9: Quiz

For functional programming languages, the scope of a local name

is always the entire program.
starts immediately at the point when the name is declared.
is in the body part of the declaration or definition.
is exactly same as object-oriented programming languages such as C++.
Click the card to flip 👆
1 / 13
Terms in this set (13)
For functional programming languages, the scope of a local name

is always the entire program.
starts immediately at the point when the name is declared.
is in the body part of the declaration or definition.
is exactly same as object-oriented programming languages such as C++.
is in the body part of the declaration or definition.
What is the result of this expression (in Scheme)?
(let ((x 10)(y 10))(- (* x y) y))

50
55
90
Error: Unable to Compute Value
90
What functional feature does the code below best exhibit?
(define start-engine (lambda ()(error-detection (wheel-velocity (wheel-sensor)) (body-velocity))))

Use local variables to store intermediate values.
procedures are first class objects.
Use recursion instead of loop.
sequential processing of components.
procedures are first class objects.
Given the Scheme code, answer the following two questions.
((lambda (x)
((lambda (x y)
(+ x y))
5 (* 7 x)))
3)

(1) The value to be passed to the parameter y is 21 .
(2) The final output of the piece of code is 26 .
1) 21
2) 26
Given the Scheme code, answer the following questions.
((lambda (x)
((lambda (x y)
(+ x y))
4 (* 6 x)))
3)

(1) The value to be passed to the parameter y is 18 .
(2) The final output of the piece of code is 22 .
1) 18
2) 22
Which of the following forms will return an error when run? Select all that apply.

(+ 2 '2)
('+ 2 3)
'(+ 2 3)
(define a a)
(define a 'a)
('+ 2 3)
(define a a)
Given this Scheme procedure:
(define foo (lambda (x)
(if (= x 0)
1
(* x (foo (- x 1)))
)
))
What does this procedure do?

compute x!
square(x)
cube(x)
absolute(x)
compute x!
What is the correct method for constructing a pair in Scheme?

(append 1 2)
(1 . 2)
(combine 1 2)
(cons 1 2)
(cons 1 2)
Which of the followings is a Scheme pair? Select all that apply.

'(x . y)
'(x . x)
'()
'(() ())
'(x . y)
'(x . x)
'(() ())
What is the return value of the code below? (min is a procedure that returns the minimum of two values.)
(define lst '(3 5 2 9))
(min (car lst) (cadr lst))

2
3
4
error message
3
What statement is accurate and correct for Scheme lists compared to pairs? (Be sure to consider the special case for an empty list!) Every pair is a list. There is only one pair that is not a list. Every list is a pair. There exists a list that is not a pair.There exists a list that is not a pair.Which of the following is equivalent to the expression below? (car (cdr '(1 2 3 4 5)) (cadr '(1 2 3 4 5)) (caddr '(1 2 3 4 5)) (cdar '(1 2 3 4 5)) (cacdr '(1 2 3 4 5))(cadr '(1 2 3 4 5))Given this expression, what is the expected result? (car (cdr '(1 2 3 4 5)) 1 2 3 42