30 "CS 367, Summer 2014 Homework 5" "H5" "gradeReport.html"
0 13 q2 "Question 1"
  1 13 q2x0 "Question 2 not answered"
  1 3 q21 "Step 1"
    2 3 q21a "Problem size not given"
    2 2 q21b "Incorrect problem size - it's not the length of the entire array but just the portion being considered"
    2 1 q21b "Incorrect problem size given" "use for errors other than the one above"
  1 3 q22 "Step 2"
    2 3 q22a "No recurrence equations given"
    2 1 q22b "Incorrect recurrence equation for base case"
    2 1 q22c "Incorrect recurrence equation for recursive case: missing constant term"
    2 1 q22d "Incorrect recurrence equation for recursive case: recursive function calls incorrect" "Don't deduct if they have T(N) = 1 + T(N/2) + T(N/2 - 1)"
  1 3 q23 "Step 3" "Grade based on the recurrence equations given in step 2"
    2 3 q23a "No reasonable hypothesis given"
    2 1 q23b "Hypothesized solution not given, but table of sizes and times are provided"
    2 1 q23c "Hypothesized solution incorrect, but table of sizes and times provided and correct" "Don't deduct for both this item and the next item"
    2 1 q23d "Hypothesized solution inconsistent with pattern of example sizes and times" "Don't deduct if already deducted in previous item"
  1 2 q24 "Step 4"
    2 2 q24a "No verification given"
    2 1 q24b "Verification incomplete"
    2 1 q24c "Logical or mathematical error in verification"
  1 2 q25 "Step 5"
    2 2 q25a "Method's complexity not given"
    2 1 q25b "Method's complexity is inconsistent with your results from the earlier steps"
    2 1 q25c "Method's complexity not expressed in big-0 notation"
    2 1 q25d "Big-O notation not correct" "i.e., contains constants, coefficents, or lower-order terms, for example, O(2N - 1)"
0 17 q1 "Question 2"
  1 5 q1a "Part A"
    2 2 q1a1 "Does not compile"
    2 3 q1a2 "Does not use recursion"
    2 2 q1a3 "Does not use the given definition"
    2 1 q1a4 "Does not calculate the power correctly"
  1 12 q1b "Part B"
    2 1 q1b0 "Undefined mathematical variables"
    2 2 q1b1 "Step 1"
      3 2 q1b1a "Problem size not given"
      3 1 q1b1b "Incorrect statement of problem size"
    2 3 q1b2 "Step 2"
      3 3 q1b2a "No recurrence equations given"
      3 1 q1b2b "Incorrect recurrence equation for base case"
      3 1 q1b2c "Incorrect recurrence equation for recursive case: missing constant term" 
      3 1 q1b2d "Incorrect recurrence equation for recursive case: recursive function calls incorrect"
    2 3 q1b3 "Step 3" "Don't deduct if no base is given on the logarithm"
      3 3 q1b3a "No reasonable hypothesis given"
      3 1 q1b3b "Hypothesized solution not given, but table of sizes and times are provided"
      3 1 q1b3c "Hypothesized solution incorrect, but table of sizes and times provided and correct" "Don't deduct for both this item and the next item"
      3 1 q1b3d "Hypothesized solution inconsistent with pattern of example sizes and times" "Don't deduct if already deducted in previous item"
    2 2 q1b4 "Step 4"
      3 2 q1b4a "No verification given"
      3 1 q1b4b "Verification incomplete"
      3 1 q1b4c "Logical or mathematical error in verification"
    2 2 q1b5 "Step 5"
      3 2 q1ca "Method's complexity not given"
      3 1 q1cb "Method's complexity is inconsistent with your results from the earlier steps"
      3 1 q1cc "Method's complexity not expressed in big-0 notation"
      3 1 q1cd "Big-O notation not correct" "For example, contains constants, coefficents, or lower-order terms, as in O(2 + log N); note: it's ok if they include a base with the logarithm"