Scribd
Upload
1K views6 pages

Abstract Datatype

An abstract data type (ADT) defines the essential characteristics of a data type without specifying its implementation. This allows for abstraction and information hiding. The document describes three common ADTs - lists, stacks, and queues. It defines their basic operations like insert, remove, push, pop, enqueue, and dequeue. ADTs provide advantages like encapsulation, abstraction, and modularity which make the data structure easier to use and modify independently of implementation details.

Uploaded by

dhiraj1223353
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
1K views6 pages

Abstract Datatype

An abstract data type (ADT) defines the essential characteristics of a data type without specifying its implementation. This allows for abstraction and information hiding. The document describes three common ADTs - lists, stacks, and queues. It defines their basic operations like insert, remove, push, pop, enqueue, and dequeue. ADTs provide advantages like encapsulation, abstraction, and modularity which make the data structure easier to use and modify independently of implementation details.

Uploaded by

dhiraj1223353
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Data Structure and Algorithm

Topperworld.in

Abstract Data Types

An Abstract Data Type in data structure is a kind of a data type whose


behaviour is defined with the help of some attributes and some functions.
Generally, we write these attributes and functions inside a class or a
structure so that we can use an object of the class to use that particular
abstract data type.
Examples of Abstract Data Type in Data Structure
are list, stack, queue etc.
The process of providing only the essentials and hiding the details is
known as abstraction.

The user of data-types does not need to know how that data type is
implemented, for example, we have been using Primitive values like int,
float, char data types only with the knowledge that these data type can
operate and be performed on without any idea of how they are
implemented.
So a user only needs to know what a data type can do, but not how it will
be implemented. Think of ADT as a black box which hides the inner
structure and design of the data type. Now we’ll define three ADTs
namely List ADT, Stack ADT, Queue ADT.

©Topperworld
Data Structure and Algorithm

1. List ADT

View of list

• The data is generally stored in key sequence in a list which has a


head structure consisting of count, pointers and address of
compare function needed to compare the data in the list.
• The data node contains the pointer to a data structure and a self-
referential pointer which points to the next node in the list.
• The List ADT Functions is given below:
• get() – Return an element from the list at any given position.
• insert() – Insert an element at any position of the list.
• remove() – Remove the first occurrence of any element from a
non-empty list.
• removeAt() – Remove the element at a specified location from
a non-empty list.
• replace() – Replace an element at any position by another
element.
• size() – Return the number of elements in the list.
• isEmpty() – Return true if the list is empty, otherwise return
false.
• isFull() – Return true if the list is full, otherwise return false.

©Topperworld
Data Structure and Algorithm

2. Stack ADT

View of stack

• In Stack ADT Implementation instead of data being stored in each


node, the pointer to data is stored.
• The program allocates memory for the data and address is
passed to the stack ADT.
• The head node and the data nodes are encapsulated in the ADT.
The calling function can only see the pointer to the stack.
• The stack head structure also contains a pointer
to top and count of number of entries currently in stack.
• push() – Insert an element at one end of the stack called top.
• pop() – Remove and return the element at the top of the stack,
if it is not empty.
• peek() – Return the element at the top of the stack without
removing it, if the stack is not empty.
• size() – Return the number of elements in the stack.
• isEmpty() – Return true if the stack is empty, otherwise return
false.
• isFull() – Return true if the stack is full, otherwise return false.

©Topperworld
Data Structure and Algorithm

3. Queue ADT

View of Queue

• The queue abstract data type (ADT) follows the basic design of
the stack abstract data type.
• Each node contains a void pointer to the data and the link
pointer to the next element in the queue. The program’s
responsibility is to allocate memory for storing the data.
• enqueue() – Insert an element at the end of the queue.
• dequeue() – Remove and return the first element of the queue,
if the queue is not empty.
• peek() – Return the element of the queue without removing it,
if the queue is not empty.
• size() – Return the number of elements in the queue.
• isEmpty() – Return true if the queue is empty, otherwise return
false.
• isFull() – Return true if the queue is full, otherwise return false.

©Topperworld
Data Structure and Algorithm

➔Features of ADT:
Abstract data types (ADTs) are a way of encapsulating data and operations
on that data into a single unit. Some of the key features of ADTs include:

• Abstraction: The user does not need to know the


implementation of the data structure only essentials are
provided.

• Better Conceptualization: ADT gives us a better


conceptualization of the real world.

• Robust: The program is robust and has the ability to catch


errors.

• Encapsulation: ADTs hide the internal details of the data and


provide a public interface for users to interact with the data. This
allows for easier maintenance and modification of the data
structure.

• Data Abstraction: ADTs provide a level of abstraction from the


implementation details of the data. Users only need to know the
operations that can be performed on the data, not how those
operations are implemented.

• Data Structure Independence: ADTs can be implemented


using different data structures, such as arrays or linked lists,
without affecting the functionality of the ADT.

• Information Hiding: ADTs can protect the integrity of the data


by allowing access only to authorized users and operations. This
helps prevent errors and misuse of the data.

• Modularity: ADTs can be combined with other ADTs to form


larger, more complex data structures. This allows for greater
flexibility and modularity in programming.

Overall, ADTs provide a powerful tool for organizing and manipulating data
in a structured and efficient manner.

Abstract data types (ADTs) have several advantages and disadvantages


that should be considered when deciding to use them in software
development. Here are some of the main advantages and disadvantages
of using ADTs:

©Topperworld
Data Structure and Algorithm

➔Advantages:

• Encapsulation: ADTs provide a way to encapsulate data and


operations into a single unit, making it easier to manage and
modify the data structure.
• Abstraction: ADTs allow users to work with data structures
without having to know the implementation details, which can
simplify programming and reduce errors.
• Data Structure Independence: ADTs can be implemented
using different data structures, which can make it easier to adapt
to changing needs and requirements.
• Information Hiding: ADTs can protect the integrity of data by
controlling access and preventing unauthorized modifications.
• Modularity: ADTs can be combined with other ADTs to form
more complex data structures, which can increase flexibility and
modularity in programming.

➔Disadvantages:

• Overhead: Implementing ADTs can add overhead in terms of


memory and processing, which can affect performance.
• Complexity: ADTs can be complex to implement, especially for
large and complex data structures.
• Learning Curve: Using ADTs requires knowledge of their
implementation and usage, which can take time and effort to
learn.
• Limited Flexibility: Some ADTs may be limited in their
functionality or may not be suitable for all types of data
structures.
• Cost: Implementing ADTs may require additional resources and
investment, which can increase the cost of development

©Topperworld

You might also like