Covers algorithms and their performance analysis, data structures, abstraction, and encapsulation. Introduces stacks, queues, linked lists, trees, heaps, priority queues, and hash tables, and their ...

The design, implementation, and analysis of abstract data types, data structures and their algorithms. Topics include: data and procedural abstraction, amortized data structures, trees and search ...

Cross-listed with DTSA 5503. Course Type: Pathway | Breadth Specialization: Foundations of Data Structures and Algorithms Instructor: Dr. Sriram Sankaranarayanan, Professor of Computer Science Prior ...

Design algorithms and analyze their complexity in terms of running time and space usage; Create applications that are supported by highly efficient algorithms and data structures for the task at hand; ...

All of the data structures we’ll look at in this series are aggregates. Containers. Anything from which data items are stored and retrieved could be considered a data structure.