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.
(The CPSC 210 home page at www.cs.clemson.edu/~lab210 also has a link to the handin command.)
We are CPSC 210, Section 2.
Points will be deducted for late programs. The standard deduction is 20 points per partial day. If a program is due by 11:59 p.m. on September 6 and it is turned in any time after that until 11:59 p.m. on September 7, 20 points will be deducted from the grade that would be obtained otherwise.
Assignment #1 Due Wednesday, January 31 by 11:59 p.m. -- Fill a circle with a bright color and inscribe a square inside the circle (30 pts.)
Assignment #2 Due Tuesday, February 13 by 11:59 p.m. -- method to compute distance between two points (30 pts.)
Assignment #3 Due Thursday, February 22 by 11:59 p.m. -- Triangle class (100 pts.)
Assignment #4 Due Thursday, March 15 by 11:59 p.m.
-- reverse a SIngly Linked List (100 pts.)
Assignment #5 Due Wednesday, April 25 by 11:59 p.m. -- Postorder Iterator for Binary Tree (100 pts.)
*************************************************************************
DISREGARD ALL ASSIGNMENTS BELOW THIS POINT
PAGE UNDER CONSTRUCTION
************************************************************************
Extra Credit #1 Due Friday, September 15 by 11:59 p.m. -- Exercise 3.9 on page 93. (50 pts.)
(Assignment #21) Draw the checkerboard of Problem 3.3, but use two Rect objects, each drawn exactly four times.
Extra Credit #2 Due Monday, September 18 by 11:59 p.m. -- Exercise 6.6 on page 157. (50 pts.)
(Assignment # 22) Write a program that is self-reproducing.
Assignment #3 Due Wednesday, September 20 by 11:59 p.m. -- problem 6.6 on page 159. (75 pts.)
Assignment #4 Due Wednesday, September 27 by 11:59 p.m. -- problem 7.10 on page 190. (75 pts.)
Assignment #5 Due Wednesday, October 5 by 11:59 p.m. -- Triangle class (100 pts. plus extra credit)
Assignment #6 Due Wednesday, October 11 by 11:59 p.m. -- Bailey's Matrix class (100 pts.)
Assignment #7 Due Wednesday, October 25 by 11:59 p.m. -- Extension of Bailey's Singly Linked List class (100 pts.)
Assignment #8 Due Friday, November 3 by 11:59 p.m. -- Extend Bailey's Circular List to include Current reference (140 pts.)
Assignment #9 Due Monday, November 20 by 11:59 p.m. -- Implement List interface and iterator using an array and wraparound (140 pts.)
Assignment #10 Due Thursday, December 7 by 11:59 p.m. -- Implement a postorder iterator for a binary tree that does not store any container (100 pts.)