Analysis of algorithms to determine their time and space requirements. Beginning with data structures such as lists, stacks, trees, and sets and their implementations. The class then analyzes specific algorithms for internal sorting, hashing, and string search. Offered fall semester of even numbered years. Prerequisite: COSC 3020 or equivalent and consent of the department.