Students will study abstract data types and their implementation. Arrays, lists, stacks, queues, trees, heaps, hash tables, maps, and graphs are considered. Fundamental algorithms including list manipulation, sorting, graph searches and tree traversals are also covered. Credit hours: 4. Prerequisite: CSCI 1156 or the equivalent.
- Teacher: Jia Wan