|CS285: Data Structures|
The course covers fundamentals of data organization and basic algorithms for data manipulation. Topics include arrays, lists, stacks, queues, trees, sets, and hash tables. Fundamentals of algorithm performance are introduced, with an emphasis placed on time complexity analysis. Special emphasis is placed on appropriate use of containers, iterators, and algorithms defined in the C++ standard library. Laboratory assignments involve both the use and implementation of common data structures.
Upon successful completion of this course, the student will:
The above course description and goals were taken from the official course description.
General Course Policies
Please review the general course policies webpage.
Data Structures in C++ Using the Standard Template Library, by Timothy Budd, Addison-Wesley, 1998.
* I would like to have lunch with you individually or as a group to get to know you better. If we eat in RWJ, housing will pick up my lunch bill. If you would prefer to eat elsewhere, we will each be responsible for our own bill. Feel free to suggest another time if the time above does not work for you.
A quiz will be given at the beginning of each lab period. The lowest quiz score will be dropped. No make-up quizzes will be given.
Unless stated otherwise, all laboratory assignments will be completed in teams of two. One lab report should be submitted for each team. One week lab assignments will be worth half the points of two week lab assignments.
|© 2001-2002 Dr. Christopher C. Taylor||Office: CC-27C||Phone: 277-7339||Last Updated: November 14, 2001|
|I am responsible for all content posted on these pages; MSOE is welcome to share these opinions but may not want to.|