Data structures deal with the organization and storage of data to facilitate efficient access and modification. They allow relationships between different data elements to be expressed and enable efficient processing and accessing of data. Data structures are classified as either primitive, like integers and characters, or non-primitive, like arrays and lists. Common operations on data structures include traversing, searching, inserting, deleting, and sorting data elements.

1. DATA STRUCTURE

2. WHAT IS MEAN BY DATA STRUCTURE?
• The data structure deals with representation of data considering not
only the elements stored but also their relationship each other.
• For writing an efficient program , a proper data structure should be
selected.
• A proper data should be selected so that the relationship between data
can be expressed .
• Processing and accessing of data should be efficient .
• Data structure is concerned with the following thing:
1. Organization of data
2.Associativity among data structures
3.Oprating on data
4.Accessing methods
5.Processing alternatives for data

3. INTRODUTION
1. Data structure is a part of computer science.
2. Data structure programs are implemented with help of ‘C language’.
3. There is a close connection between the structuring of data and
the synthesis of algorithm. For each data item ,there are number of
operations. Data should be represented in a way that makes efficient
implementation of operation.

4. NEED OF DATA STRUCTURE
1.To implement the program.
2.To reduce complexity of program.
3.To reduce space complexity of program.
4.With the help of data structure algorithms ,it’s helpful to implement
the program correctly.

5. CLASSIFICATION OF DATA STRUCTURE
• Data structure are normally divided into two categories:
• Primitive data structure The integers, real ,logical data character data,
pointer and refers are primitive data structures.
• These data type are available in most programming languages as built
in type.
• Non -primitive data structure : these data structure are derived
from primitive data structure. A of homogeneous data elements are
stored together.
• Eg: Array , Lists, Structures ,file

6. DATA
STRUCTURE
PRIMITIVE
INTEGER CHARACTER FLOAT POINTER
NON
PRIMITIVE
ARRAYS LISTS
LINEAR
STACK QUEUE
NON-
LINEAR
TREE GRAPH
STRUCTURE FILES

7. OPERATION ON DATA STRUCTURE
Many operation are performed on a data structure .Typical operation on a data
structure are:
1.Traversing
2.Searching
4.Delecting
5.Sorting
Traversing :Traversing a data structure is accessing each data and accessing only
once.
Searching: Searching is finding the location of a data in within the given data
structure.
Insertion: Insertion is adding a new data in the data structure.
Deletion : Deletion is removing a data from the data structure.
Sorting: Sorting is arranging of data in some logical order.