DATA STRUCTURES & ALGORITHMS FOR GRADUATE PROGRAM

Catalog description

The course covers the theory of Abstract Data Types (ADT's), applications and implementations of the classical ADT's including lists, sets, stacks, queues, trees, and graphs, recursion and dynamic programming, and elementary algorithm analysis. Required to take as a bridge course for Computer Information Systems (CIS) degree with admission condition. Credit hours are not counted for graduate degree requirement.