| Instructor: | Dr. Andrew Duchowski | ||||||||||||||||||||
| Office: | McAdams 309, 656-7677, duchowski [at] clemson.edu | ||||||||||||||||||||
| Office hours: | TBD (or by appointment) | ||||||||||||||||||||
| Email: | Communication with the instructor via email is encouraged. It is unlikely that a talk request will be answered, however. | ||||||||||||||||||||
| Required texts: |
|
||||||||||||||||||||
| Recommended texts: |
|
||||||||||||||||||||
| Supplemental texts: | None. | ||||||||||||||||||||
| Grading scheme: |
Based on programming assignments, final project, 1 or 2 midterms, and
the final exam.
600-level students will be required to analyze and report on technical papers in the area. |
||||||||||||||||||||
| Grade distribution: |
| ||||||||||||||||||||
| Programming assignments: | Problem specification and due date will be given in class. | ||||||||||||||||||||
| Assignment grading: | Source code and demonstrations will be required. | ||||||||||||||||||||
| Assignment format: | Electronic assignment must include the following:
| ||||||||||||||||||||
| Assignment late policy: | Late assignments will be accepted but points will be
deducted according to the formula (3n)3 where
n is the number of days late. Example: assuming assignments
are due on Tuesday, the point deduction is as follows:
Late assignments will receive lowest priority for grading and returning. | ||||||||||||||||||||
| Attendance: | Roll will be taken for the first one or two weeks while the class roll fluctuates. However, attendance is not required. Absence, excused or not, does not change the responsibility for assigned work. Tests missed due to excused absences will normally result in the test not being counted in the average grade (i.e., there will normally be no makeup tests). An unexcused absence from a test will normally result in a grade of zero for that test. Students are expected to give at least one week advance notice for excused absences. | ||||||||||||||||||||
| Independent work: | Unless otherwise stated explicitly (e.g., in the case of the final project), each student must do his or her work independently. | ||||||||||||||||||||
| Academic dishonesty: | The University policies on academic dishonesty apply. Publicly-available code or other material may be freely used if appropriately attributed. Each student is responsible for protecting his or her files from access by others. Work that is essentially the same and submitted without proper attribution is considered to be a violation of academic dishonesty policy by all those submitting the work, regardless of who actually did the work. | ||||||||||||||||||||
| Class cancelation: | Students are expected to wait for 15 minutes after the class beginning time before leaving if the instructor is late. | ||||||||||||||||||||
| Course description: |
The course will cover computer graphics methods, data
structures, analysis of algorithms, and selected implementation
examples, generally coinciding with the main programming assignments
assigned throughout the term:
|