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

The operations that may be performed on an ADT completely depend on the ADT’s purpose. For example, an ADT for a stack might include operations such as initialization, pushing data, popping data, ...

The interface with the abstract data type is created through an associated operation. What’s more, the data structures that store the representation of an abstract data type are invisible to the ...

Linear data structures; arrays, records, and linked lists. Abstract data types, stacks, and queues. Simple sorting via exchange, selection, and insertion, basic file I/O. Programming style ...