Instructor solution
You may exit out of this review and return later without penalty.
Racket Concepts
1.What is the syntax for defining a function named ackermann with two parameters m and n?
2.In plain English, what is the significance of expression (if (negative? x) -x x)
3.What is the difference between the functions cons and list?
4.Starting with (letrec ...., what is the syntax for defining the ackermann function as a "helper function"?
5.What does it mean for a list to have a recursive structure?
6.Create a closure that creates a function that creates a function that tests if a number is greater than a predefined one.
7.How does racket save stack space on tail calls?
8.Why is recursion preferred in Racket?
9.What is a tail call?
10.Describe how the following function does not use tail recursion
(define (! n)<br> (if (zero? n)<br> 1<br> (* n (! (sub1 n)))))
You may exit out of this review and return later without penalty.