Data Structures

Catalog description

This course provides a survey of fundamental data structures and algorithms needed to implement efficient, scalable programs. Topics include: arrays, stacks and queues, linked lists, recursion, binary trees, hash tables, and heaps. A significant part of this course involves actually writing programs that implement the above topics, for homework and on exams, with an emphasis on writing usable data structures that are well-engineered and reliable. Prerequisite(s): COM 1300