1.Introduction To Data Structure
i) What is data structure ?
A data structure is a storage that is used to store and organize data. It is a way
of arranging data on a computer so that it can be accessed and updated
efficiently.
A data structure is not only used for organizing the data. It is also used for
processing, retrieving, and storing data.
Classification of Data Structure:
Linear data structure: Data structure in which data elements are arranged
sequentially or linearly, where each element is attached to its previous and
next adjacent elements, is called a linear data structure.
Examples of linear data structures are array, stack, queue, linked list, etc.
Non-linear data structure: Data structures where data elements are not placed
sequentially or linearly are called non-linear data structures. In a non-linear
data structure, we can’t traverse all the elements in a single run only.
Examples of non-linear data structures are trees and graphs.
ii) What is ADT ?
The abstract data type is special kind of data type, whose behavior is defined
by a set of values and set of operations.
The keyword “Abstract” is used as we can use these data types, we can
perform different operations. But how those operations are working that is
totally hidden from the user.
The ADT is made of with primitive data types, but operation logics are hidden.
Some examples of ADT are Stack, Queue and List etc.
Advantages of ADT:
Provides abstraction, which simplifies the complexity of the data structure and
allows users to focus on the functionality.
Allow users to work with data structures without having to know the
implementation details, which can simplify programming and reduce errors
