This preview shows page 1. Sign up to view the full content.
Unformatted text preview: (b) (5 pts., 2 for efficiency, i.e., linear time) isEqual() method: (c) (10 pts., 3 for efficiency i.e., linear time) add() method: (d) (8 pts., 2 for efficiency, i.e., quadratic time and calls add()) multiply() method: C. (12 pts.) The main(): (1) (4 pts.) Does it create the initial polynomials? (2) (4 pts.) Does it call add() and multiply(), and apply the recurrence equation? (3) (2 pts.) Does it call isEqual()? (4) (2 pts.) Does it call printPoly()? D. Other grading guidelines: (1) Scores 60% (24 pts.) if the program doesnt compile. (2) Scores 75% (30 pts.) if the program compiles but generates run-time errors. (3) Extra credit is worth 10% (4 pts.). (4) Documentation (e.g., commenting, cover sheet, hardcopies) is worth 5 pts. SCORE...
View Full Document
- Summer '09
- Computer Science