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 26 -- Finding the kth largest when k=n/2. (100 pts.)
Assignment #2 Due Wednesday, February 2 -- Listing Permutations of a String. (100 pts.)
Assignment #3 Due Wednesday, February 9 -- Construction of class OrderedList. (100 pts.)
Assignment #4
Due Wednesday, February 16 -- Constructing class Stack using only List methods. (100 pts.)
Assignment #5
Part I due Monday, February 21;
Part II due Wednesday, February 23
-- adding retreat to ListItr method. (100 pts.)
Assignment #6
Due Wednesday, March 8 -- Reading words from a file, associating a
unique integer with each distinct word read, and storing the word and integer in
a hash table, using separate chaining (100 pts.)
NOTE CHANGE OF DUE DATE
Assignment #7
Due Wednesday, March 15 -- Implementing some set methods using lists. (100 pts.)
Assignment #8
Due Monday, April 3 -- Kruskal's Algorithm for Minimum Spanning Tree (MST).
Assignment #9
Due Tuesday, April 18 -- Minimum cost simple cycle through all vertices.
Assignment #10
Due Tuesday, April 25 -- Dijkstra's Algorithm (group assignment).