Following the other basic books I wanted to strengthen my basic knowledge about computer science and this book is excellent for this task. It uses Scheme as the introductory language (like SICP) and does a great job in explaining basic data structures and algorithms. If you want to seriously learn about basic computer science, this is a nice book which is also a bit easy than SICP. You can actually read Concrete Abstractions for free which is quite nice.

# concrete abstractions

There are 10 posts tagged **concrete abstractions** (this is page **1** of **3**).

# Concrete Abstractions: Chapter 12

**Exercise 12.4:** Draw a tree, analogous to Figure 4.4 on page 92, showing how the value of C(4, 2) is computed by choose. Your tree should have C(4, 2) at the root and six 1s as its leaves.

**Solution:**

**Exercise 12.6:** Using these procedures, write

**a.** A procedure called table-fill! that takes a table and an element and sets every entry in the table to the given element. For example, (table-fill! table 0) would have a similar effect to that of zero-out-vector! in Section 11.6.

**b.** A procedure called display-table that nicely displays its table parameter.

**Solution:**

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 |
(define table-fill! (lambda (table value) (define loop-row (lambda (row column) (if (= column (table-width table)) 'done (begin (table-set! table row column value) (loop-row row (+ column 1)))))) (define loop (lambda (row) (if (= row (table-height table)) 'done (begin (loop-row row 0) (loop (+ row 1)))))) (loop 0))) |

**b.**

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 |
(define display-table (lambda (table) (define show-row (lambda (row column) (if (= column (table-width table)) (newline) (begin (display (table-ref table row column)) (display " ") (show-row row (+ column 1)))))) (define show (lambda (row) (if (= row (table-height table)) (newline) (begin (show-row row 0) (show (+ row 1)))))) (show 0))) |

**Exercise 12.31:** Imagine the following game: You are given a path that consists of white and black squares. The exact configuration of white and black squares varies with the game. You start on the leftmost square (which we’ll call square 0), and your goal is to move off the right end of the path in the least number of moves. However, the rules stipulate that:

If you are on a white square, you can move either 1 or 2 squares to the right.

If you are on a black square, you can move either 1 or 4 squares to the right. […]

Write a memoized version of fewest-moves.

**Solution:**

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 |
(define fewest-moves-mem (lambda (path) (let ((table (make-vector (vector-length path)))) (define fewest-moves-f (lambda (path i) (cond ((>= i (vector-length path)) 0) ((equal? (vector-ref path i) 'white) (+ 1 (min (fewest-moves-sub path (+ i 1)) (fewest-moves-sub path (+ i 2))))) (else (+ 1 (min (fewest-moves-sub path (+ i 1)) (fewest-moves-sub path (+ i 4)))))))) (define fewest-moves-sub (lambda (path i) (ensure-in-table! path i) (vector-ref table i))) (define ensure-in-table! (lambda (path i) (if (vector-ref table i) 'done (store-in-table! table i)))) (define store-in-table! (lambda (table i) (vector-set! table i (fewest-moves path i)))) (vector-fill! table #f) (fewest-moves-f path 0)))) |

**Exercise 12.33:** The function h(n) is defined for nonnegative integers n as follows:

**a.** Write a dynamic programming procedure for efficiently calculating

**b.** Is it possible to modify the procedure so that it stores all the values it needs in a vector of fixed size, as walk-count can be modified to store the values it needs in a two-element vector? (A vector of “fixed size” is one with a size that does not depend on the parameter, n.) Justify your answer.

**Solution:** **a & b.** I implemented b directly into the code.

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 |
(define h (lambda (n) (let ((vector (make-vector (+ n 1)))) (define calc-h (lambda (n) (cond ((< n 2) 1) ((odd? n) (+ (calc-h-sub (- n 1)) (calc-h-sub (- n 2)))) (else (+ (calc-h-sub (- n 1)) (calc-h-sub (/ n 2))))))) (define calc-h-sub (lambda (n) (vector-ref vector n))) (from-to-do 0 n (lambda (i) (vector-set! vector i (calc-h i)))) (calc-h n)))) |

# Concrete Abstractions: Chapter 10

**Exercise 10.2:** Even when a category is directly testable by Scheme, using EBNF to express it at a more primitive level can help you appreciate the expressive power of EBNF. In this exercise you will use EBNF to describe certain kinds of numbers—a small subset of those allowed by Scheme.

**a.** Write a production for <unsigned-integer>. You can use the productions for <digit> given above.

**b.** Next write productions for <integer>; an <integer> may start with a – sign, a + sign, or neither.

**c.** Finally, write productions for <real-number>, which are (possibly) signed numbers that may have a decimal point. Note that if the real number has a decimal point, there must be at least one digit to the left or to the right (or both) of the decimal point. Thus, -43., .43, 43, 43.21, and 43.0 are all valid real numbers.

**Solution:** **a.** <unsigned integer> -> <digit>+

**b.** <integer> -> -<unsigned integer> | +<unsigned integer> | <unsigned integer>

**c.** <real-number> -> <integer>. | <integer>.<unsigned integer>* | .<unsigned integer>+ | <integer>

**Exercise 10.3:** In Section 8.3 we considered expression trees for simple arithmetic expressions. All such expressions are either numbers or lists having an operator (one of +, -, *, or /) and two operands. Actually, there are three important variants, depending on where the operator occurs: in the first position (prefix or Scheme notation), the second position (infix or standard notation), or the third position (postfix, also known as Reverse Polish notation, or RPN). Let’s consider how such expressions can be specified using EBNF.

**a.** Write productions for <arithmetic-prefix-expression>.

**b.** Write productions for <arithmetic-infix-expression>.

**c.** Write productions for <arithmetic-postfix-expression>.

**d.** As noted in Section 8.3, a postorder traversal of an expression tree re-

sults in a list of the nodes that is identical to the language specified by <arithmetic-postfix-expression>, except that subexpressions are not parenthesized. Revise the productions for <arithmetic-postfix-expression> so that subexpressions are not parenthesized. (The overall top-level expression needn’t be parenthesized either.)

**Solution:** <arithmetic-expression> -> + | – | * | /

**a.** <arithmetic-prefix-expression> -> (<arithmetic-expression> <real-number> <real-number>)

**b.** <aritmethic-infix-expression> -> (<real-number> <arithmetic-expression> <real-number>)

**c.** <arithmetic-postfix-expression> -> (<real-number> <real-number> <arithmetic-expression>)

**Exercise 10.4: **Let’s consider two possible additions to our Micro-Scheme grammar involving regular Scheme expressions.

**a.** Write a production for let expressions. Remember that let expressions allow zero or more bindings (i.e., parenthesized name/expression pairs), and the body of the let contains one or more expressions. You should define a separate syntactic category for <binding>.

**b.** Write productions for cond expressions. Remember that cond expressions allow one or more branches, the last of which may be an else, and each branch has one or more expressions following the test condition.

**Solution: a. **<binding> –> (let ((<name> <expression>)*) <expression>+>*)

b. <condition> –> (cond ((<expression>+ <expression>))+ (else <expression>+ )

**Exercise 10.6:
**

**Solution: a.** (if 3 1 5) is a <conditional>. Let’s check if 3, 1, and 5 are <expression>s. 3, 1 and 5 are <number>s which are <literal>s which are <constant>s which are <expression>s. So that’s valid.

**b.** (lambda x (+ x 2)) that isn’t valid because a <abstraction> needs parenthisis after lambda.

**c.** (((a ((b))) c)) that looks like an <application> let’s check if ((a ((b))) c) is an <expression>. Because an <application> is an <expression> we have to check if <em>(a ((b)))</em> and <em>c</em> is an <expression>. c is an <name> and therefore an <expression>. <em>(a ((b)))</em> is an <application> which have to consists of one or more expressions. So there’s <em>a ((b))</em> left to check. a is an <expression>. ((b)) is an <application> of an <application> of a <name> which is an <expression>. So that’s valid.

**d.** (lambda (lambda) 3). We have to check if lambda ist a <name> which is false. Not valid.

**e.** (lambda () lambda). We have to check if lambda is an <expression> which it isn’t.

**f.** (lambda (x) (if (> x 0) x (- x) 0)). Let’s check if <em>if</em> is an <conditional>. It isn’t because it has more than three <expression>s in its body.

**g.** (lambda () x). This is valid if x is an <expression>. A <name> is an <expression>, so this is valid.

**h.** (lambda () ). Not valid, because there’s no <expression> in the body.

**i.** (/). Not valid, because it needs at least two <arithmetic-expression>s in the body.

**j.** (#t #f). This is an <application> of two expressions. Are #f and #t <expression>s? They aren’t definied, so this is not valid.

**Exercise 10.31: **Use EBNF to write a grammar for the language of all strings of one or more digits that simultaneously meet both of the following requirements:

**a.** The digits alternate between even and odd, starting with either.

**b.** The string of digits is the same backward as forward (i.e., is palindromic).

**Solution: **

1 2 3 4 5 6 7 |
<even> -> 0 | 2 | 4 | 6 | 8 <odd> -> 1 | 3 | 5 | 7 | 9 <palindrome-even> -> 0<palindrome-odd>0 | 2<palindrome-odd>2 | 4<palindrome-odd>4 | 6<palindrome-odd>6 | 8<palindrome-odd>8 | <even> <palindrome-odd> -> 1<palindrome-even>1 | 3<palindrome-even>3 | 5<palindrome-even>5 | 7<palindrome-even>7 | 9<palindrome-even>9 | <odd> <legal> -> <palindrome-even> | <palindrome-odd> |

# Concrete Abstractions: Chapter 9

**Exercise 9.2:** The sequences we just described are restricted to consecutive increasing sequences of integers (more precisely, to increasing arithmetic sequences where consecutive elements differ by 1). We can easily imagine similar but more general sequences such as <6, 4, 3, 2> or <5, 5.1, 5.2, 5.3, 5.4, 5.5>—in other words, general arithmetic sequences of a given length, starting value, and increment (with decreasing sequences having a negative increment value).

**a.** Write a procedure sequence-with-from-by that takes as arguments a length, a starting value, and an increment and returns the corresponding arithmetic sequence. Thus, (sequence-with-from-by 5 6 -1) would return the first and (sequence-with-from-by 6 5 .1) would return the second of the two pre- ceding sequences. Remember that sequences are represented as procedures, so your new sequence constructor will need to produce a procedural result.

**b.** The procedure sequence-from-to can now be rewritten as a simple call to sequence-with-from-by. The original sequence-from-to procedure made an empty sequence if its first argument was greater than its second, but you should make the new version so that you can get both increasing and de- creasing sequences of consecutive integers. Thus, (sequence-from-to 3 8) should return <3, 4, 5, 6, 7, 8>, whereas (sequence-from-to 5 1) should return <5, 4, 3, 2, 1>.

**c.** Write a procedure sequence-from-to-with that takes a starting value, an ending value, and a length and returns the corresponding arithmetic sequence. For example, (sequence-from-to-with 5 11 4) should return <5, 7, 9, 11>.

**Solution:**

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 |
; a. (define sequence-with-from-by (lambda (start len inc) (lambda (op) (cond ((equal? op 'empty-sequence?) (= len 0)) ((equal? op 'head) start) ((equal? op 'tail) (sequence-with-from-by (+ start inc) (- len 1) inc)) ((equal? op 'sequence-length) len) (else (error "illegal operation" op)))))) ; b. (define sequence-from-to (lambda (a b) (if (< a b) (sequence-with-from-by a (+ (- b a) 1) 1) (sequence-with-from-by a (+ (- a b) 1) (- 1))))) ; c. (define sequence-from-to-with (lambda (start end len) (sequence-with-from-by start len (/ (+ (- end start) 2) len)))) |

**Exercise 9.6:** Write the sequence constructor sequence-map, that outwardly acts like the list procedure map. However unlike map, which applies the procedural argument to all the list elements, sequence-map should not apply the procedural argument at all yet. Instead, when an element of the resulting sequence (such as its head) is accessed, that is when the procedural argument should be applied.

**Solution:**

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 |
(define sequence-map (lambda (sequence f) (lambda (op) (cond ((equal? op 'empty-sequence?) (empty-sequence? sequence)) ((equal? op 'head) (f (head sequence))) ((equal? op 'tail) (sequence-map (tail sequence) f)) ((equal? op 'sequence-length) new-length) ((equal? op 'sequence-ref) (lambda (n) (if (= n 0) head (sequence-ref tail (- n 1))))) (else (error "illegal sequence operation" op)))))) |

**Exercise 9.:** One way we can represent a set is as a predicate (i.e., a procedure that returns true or false). The idea is that to test whether a particular item is in the set, we pass it to the procedure, which provides the answer. For example, using this representation, the built-in procedure number? could be used to represent the (infinite) set of all numbers.

**a.** Implement element-of-set? for this representation. It takes two arguments, an element and a set, and returns true or false depending on whether the element is in the set or not.

**b.** Implement add-to-set for this representation. It takes two arguments, an ele- ment and a set, and returns a new set that contains the specified element as well as everything the specified set contained. Hint: Remember that a set is represented as a procedure.

**c.** Implement union-set for this representation. It takes two arguments—two sets— and returns a new set that contains anything that either of the provided sets contains.

**Solution:**

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 |
; a (define element-of-set? (lambda (element set) (set element))) ; b. (define add-to-set (lambda (element set) (lambda (ele) (if (equal? ele element) #t (set ele))))) ; c. (define union-set (lambda (set1 set2) (lambda (ele) (or (set1 ele) (set2 ele))))) |

**Exercise 9.:** Assume that infinity has been defined as a special number that is greater than all normal (finite) numbers and that when added to any finite number or to itself, it yields itself. Now there is no reason why sequences need to be of finite length. Write a constructor for some interesting kind of infinite sequence.

**Solution:**

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 |
; Ex 9.22 (define sequence-from-to-inf (lambda (from) (lambda (op) (cond ((equal? op 'head) from) ((equal? op 'tail) (sequence-from-to-inf (+ 1 from))) ((equal? op 'sequence-length) +inf.0) (else (error "operation not found" op))))))</code> ; Interesting application (define display-even-sequence (lambda (seq) (if (even? (head seq)) (display (head seq)) (display " ")) (display-even-sequence (tail seq)))) (define display-f-sequence (lambda (seq f) (display (f (head seq))) (display " ") (display-f-sequence (tail seq) f))) |