Quiz 3

Question 1

(define L ‘(5 (3 9 2) (6 4) 1))
(caadr L)
What is the output of the code above?

(6 4), 6, 3, or (9 2)?

Answer 1

3

Question 2

Tail recursion allows recursive functions to be executed more efficiently by storing intermediate results. So, no runtime stack is necessary to remember arguments of previous calls in tail recursion, T/F?

Answer 2

True

Question 3

(define L ‘(5 (3 9 2) (6 4) 1))
(cadr L)
What is the output of the code above?

1, 5, (6 4), or (3 9 2)?

Answer 3

(3 9 2)

Question 4

Which of the following is the correct Scheme expression to calculate the greatest common divisor of 10 and 15 with a given gcd function?
(gcd 10 15), gcd(10, 15), gcd,10,15, or gcd ( 10 15)?

Answer 4

(gcd 10 15)

Question 5

(define L ‘(5 (3 9 2) (6 4) 1))
(cadddr L)
What is the output of the code above?

4, 2, 6, or 1?

Answer 5

1

Question 6

(define L ‘(5 (3 9 2) (6 4) 1))
(caddr L)
What is the output of the code above?

3, 6, (9 2), or (6 4)?

Answer 6

(6 4)

Question 7

(define L ‘(5 (3 9 2) (6 4) 1))
(car L)
What is the output of the code above?

(3 9 2), (6 4), 5, or 1?

Answer 7

5

Question 8

When you define variables in a let expression in Scheme, values of the variables can be accessed only within the let form, not outside it, T/F?

Answer 8

True

Question 9

Which function adds a new head to an existing list?

cons, null?, car, or cdr?

Answer 9

cons

Question 10

Which of the following is the correct Scheme expression to calculate (3 + 5) * 2

(* (+ 3 5) 2), (+ * (3 5) 2), (3 + 5 * 2), or (+ (3 5) * 2)?

Answer 10

(* (+ 3 5) 2)