An
abstract
data type
(ADT) is a mathematical model for data
types
where a data
type
is defined by its behavior (semantics) from the point of view of a
user of the data,
specifically in terms of possible values, possible operations on data
of this type,
and the behavior of these operations.This
contrasts with data structures, which are concrete representations of
data, and are the point of view of an implementer, not a user.
ADT
is a theoretical concept in computer science, used in the design and
analysis of algorithms, data structures, and software systems, and do
not correspond to specific features of any computer languages.
In
ADTs,inferences are derived using a mathematical or a logical
module.It is very much equivalent to writing a set of points
understandable to a user.Lets assume a list with user input data
which can be implemented in two ways:
- Using Arrays
- Using Linked Lists
Both
have their own set of advantages and disadvantages,But it is made
sure that advantages are used to make our understanding ends meet and
the idea to implement looks concrete.
Each data structure has
its limitations. One such data structure is a Linked list which is
followed in the next chapter.
