Students use data structures and recursion in Java to solve complex problems. Abstract Data Types (ADTs) including lists, stacks, queues, tables, sets, maps, heaps, and trees are examined and implemented. Students analyze the theoretical and actual running times of the alternate ADT implementations as well as internal/external searching and sorting algorithms, graph algorithms, and hashing.
Prerequisite Courses
Semester Offered
Fall