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 ...

Brief Description of Course Content Studies data abstractions (e.g., stacks, queues, lists, trees) and their representation techniques (e.g., linking, arrays). Introduces concepts used in algorithm ...

Data comes in many shapes and forms (obviously), but two of its core ‘structures’ are stacks and queues. Data elements in a stack and a queue differ by virtue of their order.