-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlab11.scm
326 lines (268 loc) · 8.22 KB
/
lab11.scm
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
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
;; ====== LAB 11 ======
;; Author(s):
;;
;; Lab Section:
;;;; Utility Functions
;; Reloads the current file.
(define (reload)
(load "lab11.scm") ; Change file name if copied to a new file.
)
;; Square
(define (square x) (* x x))
;;;; Test Case Code:
;;;; This will handle execution of the test cases we've included below.
;;;; To run test cases for a step, uncomment the (do-tests #) line.
;;;; Note: This code will run on MIT Scheme, but would have to be modified
;;;; to work with other versions of Scheme.
;;;; Change #t to #f in the line below to use for Dr Scheme / STk.
;;;; Behavior under Dr Scheme / STk is not tested.
(define (do-tests n)
(let* ((in-mit-scheme #t) ;; ** Change this value
(tests-symbol
(string->symbol
(string-append "test-cases-step-"
(number->string n))))
(test-cases
(if in-mit-scheme
(eval tests-symbol user-initial-environment)
(eval tests-symbol)))
(display-string (string-append
"\n--- Test Cases for Step "
(number->string n)
" ---\n")))
(display display-string)
(for-each
(lambda (x)
(if (and (pair? x) (eq? (car x) 'define))
(if in-mit-scheme
(eval x user-initial-environment)
(eval x))
(begin
(display x)
(newline)
(display (if in-mit-scheme
(eval x user-initial-environment)
(eval x)))
(newline))))
test-cases)))
;;;;
;;;; Step 1. A First Object
;;;;
(define count
(let ((c -1))
(lambda ()
(set! c (modulo (+ c 1) 3))
c))
)
; Suppose we have the following additional definitions:
; (define counter1 count)
; (define counter2 count)
; (define counter3 count) ...
; Do these counters behave independently of each other when called as in
; the examples below?
; (counter1)
; (counter1)
; (counter3)
; (counter2) ...
; Explain:
; Your answer here...
;
;
(define test-cases-step-1
'(
(count)
(count)
(count)
(count)
(count)))
(do-tests 1)
;;;;
;;;; Step 2. An Object Builder
;;;;
;; make-count
(define (make-count)
(let ((c -1))
(lambda ()
(set! c (modulo (+ c 1) 3))
c))
)
(define test-cases-step-2
'(
(define a (make-count))
(define b (make-count))
(a) (a)
(b) (b) (b) (b)
(a)
))
(do-tests 2)
;;;;
;;;; Step 3. What's all the flap about?
;;;;
(define (make-flip)
(let ((c -1))
(lambda ()
(begin (set! c (modulo (+ c 1) 2))) c))
)
(define test-cases-step-3
'(
(define flip1 (make-flip))
(define flip2 (make-flip))
(flip1)
(flip1)
(flip2)
(flip1)))
(do-tests 3)
;;;;
;;;; Step 4. Don't flip out.
;;;;
(define test-cases-step-4
'(
(define flip (make-flip))
(define flap1 (flip))
(define (flap2) (flip))
(define flap3 flip)
(define (flap4) flip)))
(do-tests 4)
; Evaluate each of these by hand in your interpreter and try to figure out what
; interaction causes each return value.
; Answers for each here:
(display flap1)(newline)
(display (flap2))(newline)
(display flap4)(newline)
(display (flap4))(newline)
(display ((flap4)))(newline)
;(display (flap1))(newline)
(display flap2)(newline)
(display (flap3))(newline)
;;;;
;;;; Step 5. List Mutation
;;;;
(define (list-set-nth lst n newvalue)
(cond ((null? lst) '())
((= n 0) (set-car! lst newvalue)
lst)
(else (cons (car lst) (list-set-nth (cdr lst) (- n 1) newvalue))))
)
(define test-cases-step-5
'(
(define x '(9 2 7 4 5))
(define y '(10 45 4 89))
(list-set-nth x 3 87)
x
(list-set-nth y 2 'hello)
y
))
(do-tests 5)
;;;;
;;;; Step 6. Message Passing
;;;;
;; Write a "grades" object with local state that accepts the following
;; messages: ’add-grade ’get-student-average ’get-assignment-average.
;;
;; Example
;; (define grades (make-grades))
;; student ID assignment # grade
;; ((grades ’add-grade) 12 1 89)
;; ((grades ’add-grade) 19 1 94)
;; ((grades ’add-grade) 38 1 100)
;; ((grades ’add-grade) 42 1 92)
;; ((grades ’add-grade) 12 2 86)
;; ((grades ’add-grade) 19 2 84)
;; ((grades ’add-grade) 38 2 91)
;; ((grades ’add-grade) 42 2 97)
;;
;; Then
;; ((grades ’get-student-average) 12) -> 87.5
;; ((grades ’get-assignment-average) 1) -> 93.75
;;
;; If you're having trouble imagining this, it may be helpful to load
;; lab10 and examine how we represented the table. To do this, type t
;; in the interpreter after loading the lab.
(define test-cases-step-6
'(
(define grades (make-grades))
;; student ID assignment # grade
((grades 'add-grade) 12 1 89)
((grades 'add-grade) 19 1 94)
((grades 'add-grade) 38 1 100)
((grades 'add-grade) 42 1 92)
((grades 'add-grade) 12 2 86)
((grades 'add-grade) 19 2 84)
((grades 'add-grade) 38 2 91)
((grades 'add-grade) 42 2 97)
((grades 'get-student-average) 12)
((grades 'get-assignment-average) 1)
))
(define (make-grades)
(let ((grades ()))
(define (get-student-average id)
(define (helper grades num-grades total-pts)
(cond ((and (null? grades) (= num-grades 0)) 'no-scores)
((null? grades) (/ total-pts num-grades))
((= id (caar grades))
(helper (cdr grades) (+ num-grades 1.0) (+ total-pts (caddar grades))))
(else
(helper (cdr grades) num-grades total-pts))))
(helper grades 0 0))
(define (get-assignment-average anum)
(define (helper grades num-grades total-pts)
(cond ((and (null? grades) (= num-grades 0)) 'no-scores)
((null? grades) (/ total-pts num-grades))
((= anum (cadar grades))
(helper (cdr grades) (+ num-grades 1.0) (+ total-pts (caddar grades))))
(else
(helper (cdr grades) num-grades total-pts))))
(helper grades 0 0))
(define (add-grade id anum pts)
(set! grades (cons (list id anum pts) grades))
grades)
(lambda (msg)
(cond ((eq? msg 'add-grade)
add-grade)
((eq? msg 'get-student-average)
get-student-average)
((eq? msg 'get-assignment-average)
get-assignment-average)
(else
(error "UNKNOWN -- MAKE-GRADES")))))
)
(define (get-student-average id)
(define (helper grades num-grades total-pts)
(cond ((and (null? grades) (= num-grades 0)) 'no-scores)
((null? grades) (/ total-pts num-grades))
((= id (caar grades))
(helper (cdr grades) (+ num-grades 1) (+ total-pts (caddr grades))))
(else
(helper (cdr grades) num-grades total-pts))))
(helper grades 0 0))
(define (get-assignment-average anum)
(define (helper grades num-grades total-pts)
(cond ((and (null? grades) (= num-grades 0)) 'no-scores)
((null? grades) (/ total-pts num-grades))
((= anum (cadar grades))
(helper (cdr grades) (+ num-grades 1) (+ total-pts (caddr grades))))
(else
(helper (cdr grades) num-grades total-pts))))
(helper grades 0 0))
(define (add-grade id anum pts)
(set! grades (cons (list id anum pts) grades))
grades)
(define test-cases-step-6
'(
(define grades (make-grades))
;; student ID assignment # grade
((grades 'add-grade) 12 1 89)
((grades 'add-grade) 19 1 94)
((grades 'add-grade) 38 1 100)
((grades 'add-grade) 42 1 92)
((grades 'add-grade) 12 2 86)
((grades 'add-grade) 19 2 84)
((grades 'add-grade) 38 2 91)
((grades 'add-grade) 42 2 97)
((grades 'get-student-average) 12)
((grades 'get-assignment-average) 1)
))
(do-tests 6)
;;;;
;;;; Step 7. A Gentle Introduction to the Final Project [10 pts]
;;;;