Data Structures and Analysis of Algorithms, CSCI 385, Section 1
Welcome to CSCI 385, section 1, Fall 2006. In this class we will study
classical data structures, their accompanying algorithms, and applications.
These data structures include lists, stacks, queues, trees, graphs and
arrays. We will discuss the basics of algorithm analysis and apply this to sorting, searching, and string matching algorithms.
The semester will conclude with an overview of the class of algorithms that
are NP-Complete.
The skills required for this class are a mixture of mathematics and the ability
to program in C. Students will be required to produce working programs using
the department's Linux computer systems, as well as do homework involving mathematical manipulation and proof.
Students who wish to successfully complete this class are encouraged to:
- Attend class regularly.
- Read the book.
- Ask questions.
- Experiment.
This class meets TR 6:30 - 7:45 Doucette Hall room 223.