Data Structure Algorithms with C Language
About Lesson

Abstract Data Type

If such a data type is defined algorithmically without any implementation, it is known as Abstract Data Type (ADT).  ADT gives logical view of the data type that specifies the characteristics of data, arrangement of data elements, relationship between two data elements and set of operations that can be performed on such data type.  ADT states the relationship between data elements and operations can be allowed without providing definitions to those functions.

 

Let us consider the example of Stack ADT

Stack specifying the order to be maintained when push or pop the elements.  And the operations of stack are push, pop, isempty but here nobody has provided the definitions for these functions. 

 

There can be many ways to implement the ADT depends on the language and developer.

For example, stack ADT can be implemented either by using Arrays or by Linked List.

 

For example, when you describe a smart phone characteristics like it might have characteristics like Processor, RAM, Internal and external memory and functions can perform like call, sleep, ring etc, you are not saying about any particular device.  It is like Abstract Data Type.

But when you are saying the specifications of a particular brand phone like VIVO V11pro then it can be understood as the implementation.

Types of Data Types

  1. Primitive
  2. Non-primitive

You cannot copy content of this page