Lisp 程式設計 (1002)

課本全文
scheme 的網頁, 內有 scheme 的 spec.
How to run your programs?
exercise 1: calculate the area of a right triangle
- Write a function which is called with three numbers. The function first determines if the three numbers can form a right triangle. The function then returns the area if possible or return 0 if impossible.
- Deadline: 2012 Mar 8 23:59
- Put your file(s) under ~/scheme-1002/exer1
exercise 2: calculate the cube root with a new good-enough?
- Write a function which calcuates the cube root of the argument.
- Refer to exercise 1.8 for how to improve the guess and refer to exercise 1.7 for how to write a new good-enough?.
- Deadline: 2012 Mar 15 23:59
- Put your file(s) under ~/scheme-1002/exer2
exercise 3: linear recursive vs linear iterative
- Refer to exercise 1.11.
- Deadline: 2012 Mar 22 23:59
- Put your file(s) under ~/scheme-1002/exer3
exercise 4: linear iterative expmod
- Rewrite the `expmod' in section 1.2.6 in linear iterative form.
- Refer to exercise 1.16 for how to transform the `fast-expt' from linear recursive to linear iterative.
- Deadline: 2012 Mar 29 23:59
- Put your file(s) under ~/scheme-1002/exer4
exercise 5: iterative accumulate
- Write an iterative ``accumulate''.
- Refer to exercise 1.30 and exercise 1.32
- Deadline: 2012 Apr 5 23:59
- Put your file(s) under ~/scheme-1002/exer5
exercise 6: calculate the continued fraction
- Refer to exercise 1.37.
- Both linear recursive and linear iterative versions are required.
- Deadline: 2012 Apr 19 23:59
- Put your file(s) under ~/scheme-1002/exer6
exercise 7: generalized iterative improver
- Refer to exercise 1.46.
- Please note that `iterative-improve' accepts TWO arguments, not three.
- Deadline: 2012 Apr 26 23:59
- Put your file(s) under ~/scheme-1002/exer7
exercise 8: representing a pair with a number
- Refer to exercise 2.5.
- Note the requirement of nonnegative is removed. Your method should accept two integers.
- Deadline: 2012 May 3 23:59
- Put your file(s) under ~/scheme-1002/exer8
exercise 9: variable number of arguments
- Write a procedure
  (accumulate-list op null-value a0 a1 a2 .......)
  which can be used as follows.
```
(accumulate-list + 0 9 8 7 6 5) <---- sum 9 8 7 6 5
(accumulate-list * 1 9 8 7)     <---- multiply 9 8 7
           
```
- Refer to exercise 2.20 for variable number of arguments.
- Deadline: 2012 May 10 23:59
- Put your file(s) under ~/scheme-1002/exer9

exercise 10: enumerating k-tuples

Given n and k, enumerate the k-tuples such that each tuple (a1 a2 a3 ... ak) satisfies 1 ≤ a1 < a2 < .... ak ≤ n.
Deadline: 2012 May 24 23:59
Put your file(s) under ~/scheme-1002/exer10

For example:

$ scheme48
> (enum-tuples 6 2)
'((1 2) (1 3) (1 4) (1 5) (1 6) (2 3) (2 4) (2 5) (2 6) (3 4) (3 5) 
  (3 6) (4 5) (4 6) (5 6))
> (enum-tuples 6 3)
'((1 2 3) (1 2 4) (1 2 5) (1 2 6) (1 3 4) (1 3 5) (1 3 6) (1 4 5) 
  (1 4 6) (1 5 6) (2 3 4) (2 3 5) (2 3 6) (2 4 5) (2 4 6) (2 5 6) 
  (3 4 5) (3 4 6) (3 5 6) (4 5 6))
> (enum-tuples 6 4)
'((1 2 3 4) (1 2 3 5) (1 2 3 6) (1 2 4 5) (1 2 4 6) (1 2 5 6) (1 3 4 5) 
  (1 3 4 6) (1 3 5 6) (1 4 5 6) (2 3 4 5) (2 3 4 6) (2 3 5 6) (2 4 5 6) 
  (3 4 5 6))
> (enum-tuples 6 5)
'((1 2 3 4 5) (1 2 3 4 6) (1 2 3 5 6) (1 2 4 5 6) (1 3 4 5 6) (2 3 4 5 6))
> (enum-tuples 6 6)
'((1 2 3 4 5 6))
> ,exit
$

exercise 11: extending the deriving procecure
- Refer to exercise 2.56.
- Deadline: 2012 May 31 23:59
- Put your file(s) under ~/scheme-1002/exer11
exercise 12: monitoring a function
- Refer to exercise 3.2
- Deadline: 2012 June 7 23:59
- Put your file(s) under ~/scheme-1002/exer12

exercise 13: extracting a sub-list

Write a function, (sublist L start-index sublen), which returns a sublist from L, starting from start-index and with length=sublen.

For example:

$ scheme48
> 
> (sublist '(0 1 2 3 4) 1 3)
'(1 2 3)
> (sublist '(0 1 2 3 4) 0 2)
'(0 1)
> (sublist '(0 1 2 3 4) 1 0)
'()
> (sublist '(0 1 2 3 4) 4 2)
'(4)
> (sublist '(0 1 2 3 4) 4 1)
'(4)
> (sublist '(0 1 2 3 4) 5 2)
'()
> (sublist '(0 1 2 3 4) 2 5)
'(2 3 4)
> ,exit
$ 
                     Deadline: 2012 June 13 12:00.
         
 Put your file(s) under ~/scheme-1002/exer13