Abstract Data Types (ADT)
WHAT IS ADT? Abstract Data Type (ADT) is a mathematical model for data types where a data type is defined by its behavior from the user point of view of the data. In order to organize data, we use Abstract Data Types (ADT). An Abstract Data Type may also defined as a class of objects whose logical behavior is defined by a set of values and a set of operations. ADTs were first proposed by Barbara Liskov and Stephen N Zilles in 1974. ANALOGY WITH ALGEBRAIC STRUCTURES Abstract Data Type is analogous with Algebraic Structures in Mathematics. An Algebraic Structure on a set A is a collection of operations on A. The set A within this structure is called an Algebra. E.g., 'A+B' is defined as A+(B*C) When we compare, the data structure can be referred to the set A. The finitary operations done on set A can be referred to the operations done on Abstract Data Types. Examples of Algebraic structures are Groups, rings, fields, lattices, vector spaces, mod...