CS 361


SPRING 2008
Advanced Data Structures
Jay Morris


Text: FORD, TOPP, Data Structures with C++ Using  STL, 2nd Edition
2002, Prentice Hall Publishing, ISBN 0-13-085850-1

 
The Old Dominion Honor Code is very important. Please obey all rules and regulations. Please do not be afraid to assist and learn from each other. But you must have personally written ALL code submitted for evaluation. Sophisticated software will be used to check for "borrowed" code. All students are expected to use standard security protocols on their university directories.

Perhaps more than any other course, CS361 is intended to expand the students “toolbox” of basic techniques for manipulating data, the student experience a variety of standard practices and approaches used in program design. At the concrete level, the student will begin what should be a career-long practice of accumulating useful, reusable code units.

This course explores data structures, algorithms for manipulating them, and the practical problems of implementing those structures in real programming languages and environments. Heavy emphasis is placed upon the analysis of algorithms to characterize their worst and average case requirements for running time and memory.

Late work will be assessed a 15% penalty per day each day for 6 days after that the work will recieve a mark of 0.

Samplecodes

Assignments

Submissions


For your convenience the link to CS252 is included here:
CS 252