CS 517 - DATA ORG ANALYSIS OF ALGORIT

Semester Hours: 3

Review of basic data structures such as stacks, queues, lists, B-Trees, and binary trees. Overview of file structures and access methods. Introduction to complexity analysis of algorithms. Basic algorithm design techniques such as divide & conquer, dynamic programming, and backtracking. Introduction to the classification of problems by class; i.e., tractable, NP, intractable, and unsolvable.