Solutions: Introductory exercise:
Exercise 1.1. The first exercise is fairly simple, I am not writing the answers to it.
Exercise 1.2. Translation from infix to prefix notation:
Exercise 1.3: A procedure that takes 3 numbers as arguments and returns the sum
So, I had to break this problem to two sub problems:
- Finding the smallest of the three numbers given.
- Finding the sum of squares (which had a trivial subproblem of defining what the square of a number was).
At the begining I went all out with
conds populating the entire implementation to check if some number was equal to the smallest number I found and then sum of square the other two. This was a childish approach but it worked. But then, it looked ugly, so I tried looking it up online and found a better solution - although it will do one or 2 more squares, it is still a more flexible solution- square all the three arguments, negate the square of the least. Made perfect sense!
Exercise 1.4: Behavior of the procedure:
This procedure simply does what it says, it adds two numbers a and absolute value of b. The internals of it work like-
If b is positive, evaluate:
(+ a b). Otherwise, evaluate:
(- a b).
Hence, whatever be the case, the value of a and absolute value of b are added resulting in an equivalent expression:
(+ a (abs b))
Exercise 1.5: Difference in Applicative order and Normal order evaluation
This is a rather interesting problem, and I went the other way around the first time. The key to the answer is in the idea of Normal Order Evaluation- To not evaluate the operands until their values are needed. In Applicative order, the sequence is a series of “Apply then Eval”, whereas in Normal order, we expand the procedure fully till we have just the combination of primitive elements and then reduce that to find the result. The difference is not trivial.
As in Applicative order, the evaluation process will be:
- Substitute the formal parameters with the given arguments.
- Apply the operator to the operands and evaluate them.
Now, this will attempt to evalutate
(p) which will result to itself, i.e.,
(p). Thus, we have a recurring procedure that calls itself again and again and the process will never terminate by itself. Thus we will never get an output from this procedure with Applicative order eval.
In Normal order, the interpreter will expand the entire procedure to the primitive elements, hence we will have something like this:
(if (= x 0)) will return true with the given input and since normal order ignores the arguments unless they are really needed, it will never be evaluated.
Hence, we will get an output of 0 on Normal order eval.
Disclaimer: All the solutions and code provided above are solely based on the author's ideas and opinions and can be erroneous. There is no guarantee of the correctness and validity of the answers, views or code. Use them at your own risk. What works for me doesn't necessarily have to work for you.