Abstract Data TypeS

In this article, we will learn about ADT but before understanding what ADT is let
us consider different in-built data types that are provided to us. Data types such
as int, float, double, long, etc. are considered to be in-built data types and we can
perform basic operations with them such as addition, subtraction, division,
multiplication, etc. Now there might be a situation when we need operations for
our user-defined data type which have to be defined. These operations can be
defined only as and when we require them. So, in order to simplify the process of
solving problems, we can create data structures along with their operations, and
such data structures that are not in-built are known as Abstract Data Type (ADT).
Abstract Data type (ADT) is a type (or class) for objects whose behavior is
defined by a set of values and a set of operations. The definition of ADT only
mentions what operations are to be performed but not how these operations will
be implemented. It does not specify how data will be organized in memory and
what algorithms will be used for implementing the operations. It is called
“abstract” because it gives an implementation-independent view.
The process of providing only the essentials and hiding the details is known as
abstraction.

The user of data type 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.
1. List ADT

Vies 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.
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.
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.
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:
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.
Overall, the advantages of ADTs often outweigh the disadvantages, and they are
widely used in software development to manage and manipulate data in a
structured and efficient way. However, it is important to consider the specific
needs and requirements of a project when deciding whether to use ADTs.
From these definitions, we can clearly see that the definitions do not specify how
these ADTs will be represented and how the operations will be carried out. There
can be different ways to implement an ADT, for example, the List ADT can be
implemented using arrays, or singly linked list or doubly linked list. Similarly,
stack ADT and Queue ADT can be implemented using arrays or linked lists.
STACK
class Stack:
def __init__(self):
 self.items = []

def push(self, item):

self.items.append(item)

def pop(self):
if not self.is_empty():
return self.items.pop()

def is_empty(self):
return len(self.items) == 0

def size(self):
return len(self.items)
QUEUE
class Queue:
def __init__(self):
self.items = []

def enqueue(self, item):

self.items.insert(0, item)

def dequeue(self):
if not self.is_empty():
return self.items.pop()

def is_empty(self):
return len(self.items) == 0

def size(self):
return len(self.items)
LINKED LIST
class Node:
def __init__(self, data):
self.data = data
self.next = None

class LinkedList:
def __init__(self):
self.head = None

def add_node(self, data):

new_node = Node(data)
new_node.next = self.head
self.head = new_node

def display(self):
current = self.head
while current:
print(current.data, end=" ")
 current = current.next
print()
In Python, an Abstract Data Type (ADT) is typically implemented using a class. The class
defines the interface of the ADT, specifying the methods that can be used to interact with it.
Here's a simple example of how you might create an ADT interface in Python:

from abc import ABC, abstractmethod

class AbstractDataType(ABC):
@abstractmethod
def __init__(self):
pass

@abstractmethod
def insert(self, value):
pass

@abstractmethod
def remove(self, value):
pass

@abstractmethod
def contains(self, value):
pass

# Example implementation of a Set ADT

class SetADT(AbstractDataType):
def __init__(self):
self.items = set()

def insert(self, value):

self.items.add(value)

def remove(self, value):

self.items.remove(value)

def contains(self, value):

return value in self.items

# Example usage
my_set = SetADT()
my_set.insert(1)
my_set.insert(2)
print(my_set.contains(1)) # True
print(my_set.contains(3)) # False
my_set.remove(1)
print(my_set.contains(1)) # False

In this example, AbstractDataType is an abstract base class that defines the

basic methods for an ADT (__init__, insert, remove, and contains). The SetADT
 class then inherits from AbstractDataType and provides a specific
implementation for a set.

Note the use of the abstractmethod decorator from the abc module to mark
methods as abstract. This ensures that any concrete subclass must provide
implementations for these methods.

This is just a basic example, and the actual methods and their
implementations will depend on the specific ADT you are working with. You
can extend this pattern for other ADTs like queues, stacks, linked lists, etc.

SPECIAL METHODS
It seems like you're referring to special methods in Python, often referred to as
"magic" or "dunder" methods. These methods have double underscores (__) at the
beginning and end of their names. Here are some of the commonly used special
methods in Python:

Initialization and Cleanup:

• __init__(self, ...): Constructor method, used for initializing object attributes.

• __del__(self): Destructor method, used for cleanup and resource deallocation.
Note: It's not always guaranteed to be called.

String Representation:

• __str__(self): Called by the str() built-in function and print() to get a human-
readable string representation.
• __repr__(self): Called by the repr() built-in function to get a string
representation that can be used to recreate the object.

Comparison Methods:

• __eq__(self, other): Defines the behavior of the equality operator ==.

• __ne__(self, other): Defines the behavior of the inequality operator !=.
• __lt__(self, other): Defines the behavior of the less-than operator <.
• __le__(self, other): Defines the behavior of the less-than-or-equal-to operator
<=.
• __gt__(self, other): Defines the behavior of the greater-than operator >.
• __ge__(self, other): Defines the behavior of the greater-than-or-equal-to
operator >=.

Arithmetic Methods:

• __add__(self, other): Defines behavior for the addition operator +.

• __sub__(self, other): Defines behavior for the subtraction operator -.
• __mul__(self, other): Defines behavior for the multiplication operator *.
• __truediv__(self, other): Defines behavior for the division operator /.
• __floordiv__(self, other): Defines behavior for the floor division operator //.
• __mod__(self, other): Defines behavior for the modulo operator %.
• __pow__(self, other, modulo=None): Defines behavior for the power operator **.
• __iadd__(self, other) : Defines behavior for the in-place addition operator +=.
• __isub__(self, other) : Defines behavior for the in-place subtraction operator -=.
• ... and similar methods for other in-place operations.

These methods allow you to customize the behavior of your objects in various
contexts. When you create a class and define one or more of these methods, you're
implementing the corresponding functionality for instances
class Person:
def __init__(self, name, age):
self.name = name
self.age = age

def __str__(self):
return f"Person(name={self.name}, age={self.age})"

# Creating an instance of the Person class

person = Person("Alice", 30)

# Using the __str__ method

print(str(person))