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 241 home page at www.cs.clemson.edu/~lab241 for a link to the handin command.)
Assignment #1 Due Wednesday, January 31 -- Deck of cards using Weiss' LinkedList class. (100 pts.)
The following extra credit is available:
On Friday turn in (on paper) during the class meeting a printout of the
beginning of your DeckOfCards class that contains the default constructor
and the toString() method. When using department printers, use the
line printer for printing program code, not the laser printer. (10 pts.)
Additional extra credit: On Monday turn in (on paper) a continuation of
the printout requested for Friday that, in addition to the default
constructor and the toString() method, also contains the cut() method
and the perfect shuffle method. This is a minimum requirement. The
code turned in may contain as many methods as you have completed. (10 pts.)
Assignment #2 Due Wednesday, February 7 --
Radix sort using an extension of Weiss' LinkedList class. (100 pts.)
Assignment #3 Due Thursday, February 22 -- Part I of B+Tree -- insert L+1 keys. (100 pts.)
Assignment #4 Due Thursday, March 15
-- Part II of B+Tree -- insert, find, and print sequentially. (100 pts.)