Description

This course will cover the fundamentals of advanced data structures and algorithms. The student will be prepared to use this subject matter when it is encountered in advanced or related courses.

Texts

Brassard and Bratley, Fundamentals of Algorithms, Prentice Hall, 1996.

Parberry, Problems on Algorithms, Prentice Hall, 1996.

References

Munakata, Fundamentals of the New AI, Springer Verlag, 1998.

Cormen, Leiserson, Rivest, Introduction to Algorithms, McGraw hill, 1990.

Goals

The student will learn how to apply the material, reason with the concepts, and be able to solve problems.

Topics

Growth of functions

Combinatorics

Searching/sorting/retrieval

Trees/graphs/networks

Greedy algorithms

Dynamic programming

Matrices

Neural networks

Genetic algorithms

Fuzzy algorithms

Computing theory

Probability/random algorithms

Grading

The final grade will be based on three equally weighted exams - 75%

Homework - 10%

Project - 15%