Question: Question 31 A Scheme compiler will translate a tail recursive function into code that executes as a loop. True False 2 points Question 32 A
Question 31
A Scheme compiler will translate a tail recursive function into code that executes as a loop.
True
False
2 points
Question 32
A function application is a call to a defined function using actual parameters.
True
False
2 points
Question 33
Scheme expressions that begin with keywords are called control forms.
True
False
2 points
Question 34
The simplest unit of syntax in Scheme is called an atom.
True
False
2 points
Question 35
Which of the following is an object-oriented language?
| C++ | ||
| C | ||
| FORTRAN | ||
| Algol |
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
