Exam 2 Grading Guidelines

These are the grading guidelines that were used to grade the second exam.

Page 1

Question 1

• All or nothing here

Page 2

Questions 2

• If completely blank 0
• Pulse point (i.e. they at least tried) +1
• Sort of getting the gist +2/3
• Fully correct +4
• Key phrase: Objects are instances of classes. 4 points for any variation on that

Question 3

• If completely blank 0
• Pulse point (i.e. they at least tried) +1
• Sort of getting the gist +2/3
• Fully correct +4
• Key phrases: A program that tries to determine if another program will end. Infinite loops that are impossible to stop to show are infinite. (It may or may not go on forever, we don’t know because it would have to run forever to know).
• 4 points if they mention figuring out if an loop stops put not a program to determine if another program stops.

Question 4

• If completely blank 0
• Pulse point (i.e. they at least tried) +1
• Sort of getting the gist +3/4
• Fully correct +6
• Key phrase: It is an algorithm that has been proved impossible to find. A human can not solve this problem and therefore we can not program a computer to solve this problem.
• 2-3 for some variation of its important to determine if a loop ends or not

Question 5

• If completely blank 0
• Pulse point (i.e. they at least tried) +1
• Sort of getting the gist +2/3
• Fully correct +4
• .equals compares content while == compares reference addresses
• “Because you can’t compare the values of a string using ==” isn’t good enough. Does not answer why(2 pts)

Question 6

• If completely blank 0
• Pulse point (i.e. they at least tried) +1
• Sort of getting the gist +2/3
• Fully correct +4
• A do-while look iterates once, a while loop may or may not iterate; 2 points for each part of this

Page 3

Question 7

• 3 points for each part
• 1 pt for writing anything on the three problems if not correct

Page 4

Question 8

• +1 outer if
• +2 if setting max=amount1
• +2 if setting max=amount2
• +1 print statement
• -1 print at the wrong time or missing
• -1 changing max when not appropriate
• -1 syntax error

Question 9

• +1 sets y
• +1 boolean expression
• +1 “?” separating Boolean exp. And potential values
• +1 correct order of values
• +1 if answered
• -1 sets y at wrong time
• -1 incorrect Boolean expression
• -1 syntax error

Question 10

• +5 if mentioned how odd numbers will result or increment by 3
• -1 if almost there but not quite
• -1 extra information that is wrong

Page 5

Question 11

• -1 for less than equal to with a bar underneath
• -1 for incorrect indexes
• -2 for incorrect loop condition
• -2 for incorrect incrementation

Question 12

• -4 incorrect for loop syntax

Question 13

• -2 Incorrect vector methods
• -1 No typecasting
• -3 Incorrect for-loop syntax

Page 6

Question 13

• -2 for each incorrect answer
• Part a must be void, not none or nothing
• Part c nothing, none, or constructor are acceptable, void is not

Question 14

• 3 points for each section
• -2 on part a and b if they have multiple answers and one is correct
• Part c is all or nothing

Page 7

Question 15

• Generally 4 points for method prototype:
  • -1 wrong return type
  • -1 wrong function name
  • -1 wrong parameter type
  • -2 parameter at all (unless using Scanner)
  • -2 for using a Scanner AND declaring a parameter
• 4 for calculations and syntax:
  • -1 for putting the function in the main method
  • -1 any syntax (brackets, semicolons, etc)
  • -1 for double/int issues (1/2 is 0, not 0.5)
  • -1 for using ^2
• 2 for returning the value correctly:
  • -2 printing result instead of returning