CS306 Processing Systems and Structures Lockwood, Spring 2003

Machine Problem 1: Grading Report

Please visit a TA in the Urbauer 115 Laboratory during Lab Hours and ask him or her
to complete and submit this form when you demonstrate your machine problem.

The TA should: check your solutions and complete all fields on this form.

Once this form is submitted, use your own machine to upload code for your machine problem

Student ID Use same ID as selected in HW0. Enter in ALL CAPS
Student Name (first)
(last)

CategoryPointsMinMax
CompTotal
  • Calculates correct total score for each record using HW, MP, exam, and final fields.
  • Divides homework subtotal by four
  • Works with any number of records and values (try gbk-big.dta)
  • Uses inner loops to interate though subscores.
016
FillTable
  • Computes correct distribution Array
  • Computes MinBin, MaxBin as lowest/highest non-zero score bins
  • Properly assigns student to bin n for score between 16*n to 16*n+15
  • Works with any number of records and values (try gbk-big.dta)
017
PlotChart
  • Plots distribution chart with ASCII asterisk (*) symbol
  • Prints MIN .. MAX ranges at start of each line
  • Works with any number of records and values (try gbk-big.dta)
017
PenalitiesPointsMinMax
Comments (* percentage of code written)
  • Clear and precise line & procedure comments
    (describes all major routines): -0
  • Sports Announcer comments (line-by-line): -1
  • Unclear comments: -1
  • Sparse comments: -3
-50
Technique & Style (* percentage of code written)
  • Compact and Efficient code: -0
  • Contains repeated code (lacks loops): -3
  • Makes poor use of registers and/or variables: -2
-50
I/O Specs & Modularity (* percentage of code written)
  • Violates specifications for given subroutines: -5
-50
Late or Early BonusPointsMinMax
Before 5pm on deadline: +1 point/weekday
After 5pm on deadline: -10 points/weekday 		-505
Total ScorePointsMinMax
Total (Sum of scores) 055
TA Remarks