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. (prereq: CS-183) (2-2-3)

On successful completion of this course, the student will:

• Understand and apply complex data structures and algorithms.
• Use appropriate algorithms (and associated data structures) to solve complex problems.
• Have a thorough understanding of the Standard Template Library.
• Be able to analyze the complexity of algorithms (both sequential and recursive).
• Understand the use of recursion in problem solving.
• Be able to use data structures in software design and implementation.
• Be able to apply the STL in software design.

The above course description and goals were taken from the official course description.

Please review the general course policies webpage.

Data Structures in C++ Using the Standard Template Library, by Timothy Budd, Addison-Wesley, 1998.

Quizzes will be given nearly every week. They will be announced at least one lecture in advance. 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. Lab assignments are worth 100 points per week of the assignment.

* 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.

© 2001-2006 Dr. Christopher C. Taylor

Office: CC-36C

Phone: 277-7339