CS 344 Algorithms and Data Structures
Spring 2001

Brief Description. Building on the knowledge you gained in CS 142, in this course you will study more advanced data structures (and their associated algorithms) and learn more about the formal analysis of algorithms. In particular, we will study and analyze the efficiency of the following data structures: binary search trees, balanced trees, hash tables and heaps. Programming will be done in C++. Time permitting, we will cover some graph algorithms and some techniques for algorithm design.

Instructor. Alexis Maciel
Office: Science Center 379
Phone: 268-2385
E-mail: alexis@clarkson.edu.

Office Hours. Monday through Friday 2:00-3:00, and by appointment.

Required Text.

We will cover most of Chapters 1 to 7 and possibly parts of Chapters 8 to 10.


Homework assignments 15%
Quizzes 20%
Two tests 30%
Final exam 35%

Assignments will be a combination of written and programming exercises. The assignment policy for the course will be stated on the first assignment. The average grade on the tests and final exam will replace any lower grade on a quiz. Tentative dates for the tests: February 23 and April 6.