|Lecture||Tech LR5; MF 2:00—3:20|
|Text||Programming Languages: Application and Interpretation|
|How to Design Programs|
by Felleisen, Findler, Flatt and Krishnamurthi
Essentials of Programming Languages
by Friedman and Wand
|Piazza||Class (should link to EECS 321, Winter 2015)|
quick-ref.rkt a quick reference to things Racket; open in DrRacket
|T Lab, Tech F252|
Version 6.1.1 of Racket is installed in /home/software/racket-6.1.1/bin/drracket on the linux side of the t-lab machines.
You homework each week will be graded either automatically, or by the instructor reading over the homework carefully. If it is read by the instructor, it will be graded on a scale of 0 to 9, as follows:
| ||9|| ||all functionality there, working, and well tested (A)|
| ||8|| ||something wrong, but not in the essential parts of the assignment, well tested (A-)|
| ||7|| ||something wrong in the essential parts of the assignment, but well tested (B)|
| ||6|| ||lots wrong with essential parts of the assignment, but well tested (C)|
| ||5|| ||woeful tests, no matter how good the rest is (D)|
| ||4-1|| ||you don't want to be here|
| ||0|| ||nothing handed in, or honor code info missing (F)|
If it is graded automatically, you will receive either a check+ (A), check (B), check- (C), or 0 (F). The instructor will grade only a few assignments for each student; which homework is which is determined randomly.
The automatically graded homeworks and the manually graded ones are all worth the same amount in the computation of your final grade (but the manually graded ones will have more useful feedback written in them).
Any homework assignment may be handed in after the due date, but with ceiling on the score. To accept the homework, the handin server will have separate (logical) assignments, named hw1-second-try, hw2-second-try, etc. These homeworks will always be automatically graded (of course, strange results from the auto-grading system will be investigated upon request). When your final grade is computed, the higher of the original grade and the -second-try grade will be used, except that if the -second-try grade is a check+ then it is treated as a check for this purpose. In other words, your second try cannot raise your grade if the first try was already a check or an 8 or a 9.
The last time second-try assignments will be accepted is the Saturday (any time Saturday) after finals. I have to hand in grades on Monday, so that gives me Sunday and Monday morning to figure them out.
Office Hours: by appt (send email; I'm around during the day during the week)
Office Hours: the Wilkinson lab (M338), W 3-5pm
Office Hours: in the Wilkinson lab (M338), Th 11am-1pm
Office Hours: in the Wilkinson lab (M338), W 1-3pm
|1||Monday, January 5th, 2015||Introduction to PL & Racket;|
|PLAI §1, §2|
|1||Friday, January 9th, 2015||HW 1: Setup and Finger Exercises|
|1||Friday, January 9th, 2015||Free, bound, and binding identifiers|
|2||Monday, January 12th, 2015||Functions and Parsing|
|PLAI §3, §4|
|2||Friday, January 16th, 2015||HW 2: Free, bound, and binding identifiers|
|2||Friday, January 16th, 2015||Deferred Subst|
|PLAI §4, §5|
|3||Monday, January 19th, 2015||MLK day; no class|
|3||Friday, January 23rd, 2015||HW 3: Multi-arity functions|
|3||Friday, January 23rd, 2015||Higher-order functions|
|4||Monday, January 26th, 2015||Higher-order functions|
|4||Friday, January 30th, 2015||HW 4: Deferred Substitution, if0, neg?, and mult|
|4||Friday, January 30th, 2015||Random Testing|
|5||Monday, February 2nd, 2015||Higher-order functions|
|5||Friday, February 6th, 2015||Y, Recursion via mutation|
|PLAI §12, 13|
|6||Monday, February 9th, 2015||Recursion, State|
lecture09.pdf (cotd) lecture10.pdf
|PLAI §12, 13|
|6||Friday, February 13th, 2015||HW 5: Functions do more than you thought: natural numbers|
|6||Friday, February 13th, 2015||State|
|PLAI §12, 13|
|7||Monday, February 16th, 2015||GC|
|7||Friday, February 20th, 2015||HW 6: State|
|7||Friday, February 20th, 2015||GC|
|8||Monday, February 23rd, 2015||GC|
|8||Friday, February 27th, 2015||GC|
|9||Monday, March 2nd, 2015||Types|
|9||Friday, March 6th, 2015||Implementing a Type Checker|
|9||Friday, March 6th, 2015||HW 7: GC|
|10||Monday, March 9th, 2015||Implementing a Type Checker|
|10||Friday, March 13th, 2015||HW 8: Types|
Working with others on assignments is a good way to learn the material and we encourage it. However, there are limits to the degree of cooperation that we will permit.
When working on programming assignments, you must work only with others whose understanding of the material is approximately equal to yours. In this situation, working together to find a good approach for solving a programming problem is cooperation; listening while someone dictates a solution is cheating. You must limit collaboration to a high-level discussion of solution strategies, and stop short of actually writing down a group answer. Anything that you hand in, whether it is a written problem or a computer program, must be entirely your own work. If you base your solution on any other written solution, you are cheating.
Note: allowing your work to be copied is cheating just as much as copying another's work, and thus also subject to punishment.
If you have any questions about what constitutes cheating, please ask.