This website is preserved for historical and scholarly reference and is no longer actively maintained.
Individual Programming Assignments are just that, individual. Do not look at anyone else's assignment. If you discuss the assignment with another person, neither of you is to have a writing implement in your hand. You may, however, help another person identify and remove compiler errors.
Programs will be submitted using the handin command. (See the CPSC 210 home page at www.cs.clemson.edu/~lab210 for a link to the handin command.)
Assignment #1 Due Tuesday, May 30 -- Choice of Problems 3.13, 3.14, or 3.15 on page 92. (100 pts.)
Assignment #2 Due Friday, June 2 -- Problem 3.9 on page 94 (100 pts.)
Assignment #3 Due Tuesday, June 6 -- modification of problem 5.10 on page 144. (100 pts.)
Assignment #4 Due Friday, June 9 -- Efficient computation of a power using only multiplication (100 pts.)
Assignment #5 Due Tuesday, June 13 -- Ngon class implements Drawable interface (100 pts, but 110 pts. available)
Assignment #6 Due Friday, June 16 -- complete Bailey's Matrix class (100 pts.)
Assignment #7 Due Tuesday, June 20 -- reverse a Singly Linked List (100 pts.)
Assignment #8 Due Friday, June 23 -- Iterator which returns primes (100 pts.)
Assignment #9 Due Monday, June 26 -- Iterator for binary tree that does not keep stack (100 pts.)