Fall Quarter 2000

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.

Objectives

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

General Course Policies

Please review the general course policies webpage.

Textbook

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

My Schedule

Quizzes

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.

Laboratory

Unless stated otherwise, all laboratory assignments will be completed in teams of two. One lab report should be submitted for each team.

Grading

Tentative Schedule