Professional Documents
Culture Documents
Assignment 6 Peer Review Grading Info
Assignment 6 Peer Review Grading Info
General Overview
Same as we’ve done in previous weeks.
Note that for many of these problems there are multiple solutions
to the same question.
e.g. the language of a* could be represented as {an|n is a
natural number} or {Λ, a, aa, aaa, …. } or many more ways.
If you’re not sure that the answer given is correct, you should
check with me (and your classmates!) before grading it!!!
Name in Prob # Solution (and special grading notes)
Rubric
Remember, to get full credit they must always show work!!!
Grade 01 11.2 #6b
Start out by making sure they shouldn’t get a zero for both parts
● They get a zero for both parts if they don’t eliminate state 1 before eliminating state 2
○ Besides making sure they eliminated state 1 before eliminating state 2, it
doesn’t matter what order they do it in: 0,1,2,3 or 3, 1, 2, 0 or 1,3,0,2 etc. etc.
● They get a zero for each part if they don’t show any work
Assuming they don’t get a zero, each part is out of 2 points - standard grading scheme
● First half: Standard 0-2 points for the first 2 states they eliminate
○ fill that in under grade 03
● Second half: Standard 0-2 points for the second 2 states they eliminate
○ fill that in under grade 04
● Make sure you comment on both parts!!!
They get a zero for all 3 parts if they didn’t show any work
Grade 05: You’re just checking that they added the s and f states and corresponding
transitions correctly. Use the standard 0-2 type grading and then divide the grade
you give them in half so that they end up with a grade between 0 and 1. Here’s
what it should look like after they’re done this part:
Grade 06:
● The next thing they should do according to the directions is eliminate state
1. To do so they should compute:
○ New (0,3)
○ New (0,2)
○ New (2,2)
○ New (2,3)
● They get ½ a point for each of these that they get right
● My answer is below
Grade 07:
We’re just going to grade one more part of this … the eliminate state 3, again that’s
for 2 points
● To do so they should compute:
○ New (0,f)
○ New (2,f)
● They get one point for each of these that they get right
● My answer is below
Grade 08 Additional Here’s my answer (told you this one was easy!)
6.8
Grade 09 Additional Here’s my answer:
6.9
Grade 12 Additional Before I show you my answer, let me tell you about my thinking. The
6.12 machine has 4 different possible states:
1 Balance of 5 cents and didn’t just give an apple
Now that you understand my thinking, my image below should make sense