Machine Problem 2: Grading Report

Please print this page and provide it to the TA when you demonstrate your machine problem.
When you submit this, the TA should:
check your solutions,
ask questions to test your understanding of the MP,
assign points for each item on the list,
check the 'Demo' box,
assign bonus/penalty points,
and provide the floppy for electronic handin.
This page should be stapled to the front of your MP1 assignemnt.

Name:
Date Submitted:
Demo To:	Graded By:

Handin to floppy

Score recorded

Gold Star
Programming Excellence

Completed Checksheet. (Grader will give you this when you turn it in.)

Demonstration Steps
Follow these steps to receive credit for your checkpoint and final submission

Verify that your program is fully functional!
- Run the program interactively
- Verify function of backspace for Hex, Decimal, and ASCII input
- Verify backspace stops at first and last characters
- Verify bounds checking for key inputs
- Observe LIBUSAGE upon exit.
Verify given test inputs
- MP2 < test1.in == test1.out
  ..
- MP2 < test4.in == test4.out
- Observe LIBUSAGE upon exit.
Verify additional test cases, as requested by TA.
- Test range checking for ReadKeys
- Use ReadKeys to check for prime numbers
- Use ReadKeys to check for relatively prime numbers
- Observe LIBUSAGE upon exit.

Checkpoint1 Submission
Follow these steps to receive credit for Checkpoint 1

Have TA checkoff each fully functional routine
Have TA subtotal functional points
Have TA initial gradesheet
Put your name on the gradesheet
Have TA store store this gradesheet in the cabinet.
You need NOT submit sourcecode for Checkpoint1 !

Final Submission
Follow these steps to submit your MP

Have TA locate your checklist from the cabinet.
Follow same steps as for Checkpoint1 to receive credit for remaining 20 points
Print your sourcecode using GreenPrint
Run A:\HANDIN YourWinLogin to submit your code.

Category Points Min Max PrintBuffer Prints out the contents of the buffer to the screen in ASCII. Prints out the contents of the buffer in HEX. 0 5 ReadBuffer Read input from the keyboard. Allows backspacing, but prevents underflow. Properly handles carriage returns when reading ASCII, Decimal or HEX. Ignores line feeds. Rejects invalid input and beeps. Prevents overflow of the buffer. 0 10 CodeBuffer Calls ExpModN to encode or decode the buffer. 0 3 ExpModN Calculates y^x%z Return value is always less than z. 0 5 CheckPrime Checks to see if a number is prime. Sets ZF=0 if prime. 0 5 ReadPublicKeys Sets Variables n and e. Rejects n if n < 128. Rejects e if e > n. 0 5 ReadKeys Reads values for p, q, and e. Displays proper ranges where appropriate, and rejects any input is not within that range. Sets n and d appropriatly. Displays the new values of the keys. Allows e to be a NON-prime number, as long as it is RELATIVELY prime to (p-1)*(q-1). Example: p=17, q=13, (17-1)*(13-1)=192. Allows: e=25 and calculates d=169 0 10 GetD Calculates the modular inverse of e. If e has no inverse, returns 0. 0 7 First Checkpoint 9/30/98 0 30 Penalty After 5pm. Wed 9/30/98: -10 pts/weekday -50 0 Second Checkpoint 10/7/98 0 20 Bonus Before 5pm. Wed 10/7/98: +1 pt/weekday 0 5 Functionality SubTotal 0 50 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: -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: -2 Does not use subroutines to perform the same function: -3 -5 0 Total 0 55

Category	Min	Max
PrintBuffer Prints out the contents of the buffer to the screen in ASCII. Prints out the contents of the buffer in HEX.	0	5
ReadBuffer Read input from the keyboard. Allows backspacing, but prevents underflow. Properly handles carriage returns when reading ASCII, Decimal or HEX. Ignores line feeds. Rejects invalid input and beeps. Prevents overflow of the buffer.	0	10
CodeBuffer Calls ExpModN to encode or decode the buffer.	0	3
ExpModN Calculates y^x%z Return value is always less than z.	0	5
CheckPrime Checks to see if a number is prime. Sets ZF=0 if prime.	0	5
ReadPublicKeys Sets Variables n and e. Rejects n if n < 128. Rejects e if e > n.	0	5
ReadKeys Reads values for p, q, and e. Displays proper ranges where appropriate, and rejects any input is not within that range. Sets n and d appropriatly. Displays the new values of the keys. Allows e to be a NON-prime number, as long as it is RELATIVELY prime to (p-1)(q-1). Example: p=17, q=13, (17-1)(13-1)=192. Allows: e=25 and calculates d=169	0	10
GetD Calculates the modular inverse of e. If e has no inverse, returns 0.	0	7
First Checkpoint 9/30/98	0	30
Penalty After 5pm. Wed 9/30/98: -10 pts/weekday	-50	0
Second Checkpoint 10/7/98	0	20
Bonus Before 5pm. Wed 10/7/98: +1 pt/weekday	0	5
Functionality SubTotal	0	50
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: -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: -2 Does not use subroutines to perform the same function: -3	-5	0
Total	0	55