CS306 Processing Systems and Structures Lockwood, Spring 2002

Machine Problem 1: Grading Report

Print this page and provide it to the TA when you demonstrate your machine problem in the laboratory.
The TA should verify each functionality item, initial the 'Demo' box, assign functionality and bonus points,
then ask you to copy your files electronically via the on-line submission
. Finally, hand in this gradesheet stapled to the front of a hardcopy of your .ASM program to a TA in the lab.

Category Points Min Max

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.

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)

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)

Penalty/Bonus
Before 5pm on deadline: +1 pt/weekday
After 5pm on deadline: -10 pts/weekday

-50

Functionality SubTotal

Demo To:

Date Submitted:

Electronic Submission Completed.

Category Points Min Max

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

-5 0

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

-5 0

I/O Specs & Modularity (* percentage of code written)

Violates specifications for given subroutines: -5

-5 0

Total

0 55

Graded By: Score recorded Gold Star
Programming Excellence

Your Name	Date