Data structures organize data in a computer so it can be used efficiently. They depict the logical relationship between data elements and allow efficient data manipulation. Common data structures include arrays, stacks, queues, and linked lists which are linear structures that arrange elements sequentially, and trees and graphs which are non-linear structures that arrange elements hierarchically. Data structures are important for handling large data sets, fetching data efficiently, and making algorithms simpler and faster.

1. DATA STRUCTURES

2. Introduction to Data structures
Unorganized
Library
Words are
organized in
alphabetical
order

3. Importance of Data structures
• Adding structure to our data can make the algorithms much simpler,
easier to maintain, and often faster.
• To handle huge data.
• To fetch and process the data in an efficient way.

4. Definition of Data Structures
Definition:
• A data structure is way to store and organize data in a computer , so
that it can be used efficiently.
• The data structure can be defined as the collection of elements and
all the possible operations which are required for those set of
elements.
Example: Set of elements in an array. Operations are reading, storing,
searching, sorting etc.,

5. Characteristics of Data Structures
• It depicts the logical representation of data in computer memory.
• It represents the logical relationship between the various data
elements.
• It helps in efficient manipulation of stored data elements.
• It allows the programs to process the data in an efficient manner.

6. Operations on Data Structures
• Insertion
• Deletion
• Sorting
• Searching
• Update

7. Types of Data structures
Data Structures
Primitive / Primary
Data Structures
Non Primitive/
Secondary Data
Structures
Examples: int, Char,
Float etc.,
Linear Data
structure
Example: Lists,
Stacks, Queues
Non- linear Data
Structures
Examples : Trees,
graphs

8. Types of Data structures Cont..
Primary Data Structures/Primitive Data Structures:
• Primitive data structures include all the fundamental data structures that can be
directly manipulated by machine-level instructions.
• Some of the common primitive data structures include integer, character, real,
boolean etc
Secondary Data Structures/Non Primitive Data Structures:
• Non primitive data structures, refer to all those data structures that are derived from
one or more primitive data structures.
• The objective of creating non-primitive data structures is to form sets of homogeneous
or heterogeneous data elements.

9. Types of Data structures Cont..
Linear Data Structures:
Linear data structures are data structures in which, all the data elements are
arranged in linear or sequential order. Examples of data structures include
arrays, stacks, queues, linked lists, etc.
Non Linear Structures:
In non-linear data structures, the data elements are not arranged in linear order.
A non-linear data structures could arrange data elements in a hierarchical manner.
Examples of non-linear data structures are trees and graphs.

10. Applications of Data structures
•Compiler design
•Operating system
•Database Management Systems
•Graphics
•Artificial Intelligence
•Networking
•Simulation