1. Home
  2. Docs
  3. Data Structure
  4. Introduction
  5. Abstract Data Type

Abstract Data Type

An abstract data type (ADT) is the way we look at a data structure, focusing on what it does and ignoring how it does its job. The abstract data type is a triple of D-set of Domains, F-Set of functions, A-Axioms in which only what is to be done is mentioned but how is to be done is not mentioned.

ADT = Type + Function Names + Behavior of each function

Examples

  • Stacks
  • Queues
  • Linked List

ADT Operations

While modeling the problems the necessary details are separated out from the unnecessary details. This process of modeling the problem is called abstraction. The model defines an abstract view to the problem. It focuses only on problem related stuff and that you try to define properties of the problem.

These properties include,

  • The data which are affected
  • The operations which are identified.

Abstract data type operations are,

  • Create: create the database.
  • Display: displaying all the elements of the data structure.
  • Insertion: elements can be inserted at any desired position.
  • Deletion: desired element can be deleted from the data structure.
  • Modification: any desired element can be deleted from the data structure.

Advantage of using ADTs

  • It is reusable, robust
  • It can be re-used at several places and it reduces coding efforts
  • Encapsulation ensures that data cannot be corrupted
  • The Working of various integrated operation cannot be tampered with by the application program
  • ADT ensures a robust data structure

Views: 0

How can we help?

0 0 votes
Article Rating
Subscribe
Notify of
guest

0 Comments
Oldest
Newest Most Voted
Inline Feedbacks
View all comments