CS115 Lecture Notes - Lecture 1: Wrapper Function
13
CS115 Full Course Notes
Verified Note
13 documents
Document Summary
A list of functions described in each module of the lecture slides can be found on piazza at post @8. It will not be accepted by course staff as an assignment submission. It will make your submitted file unreadable and you will receive no correctness marks. Language level: beginning student with list abbreviations. Coverage: module 6 & 7. Due: wednesday march 18th at 4:00 p. m. (define-struct scorecard (name try1 try2 try3)) ;; a scorecard is a (make-scorecard str num num num) ;; name is the name of the current player (define-struct resultcard (name best-try)) ;; a resultcard is a (make-resultcard str sym) ;; requires: best-try is one of "i "ii "iii. ;; an attemptfrequencypair (afp) is a (list best-att freq) ;; requires: best-att is one of "i "ii "iii. ;; freq is a nat representing the frequency of best-att (define-struct flowerbomb (power complexity regenerate?)) ;; a flowerbomb is a (make-flowerbomb nat nat bool)
