THINK DIFFERENT

1. DATA STRUCTURE
 INTRODUCTION
 DATA
 INFORMATION
 CLASSIFICATION
PRESENTED BY
DHANANJAY KUMAR

2. DATA STRUCTURE
When the elements of data are
organised in such a way that
represent a relation among each
data element the way of
organisation is known as data
structure.
" In computer science, a data
structure is a particular way of
organizing data in a computer so
that it can be used efficiently."

3. DATA STRUCTURE
EXAMPLE :-
Unorganised Form Organised Form

4. DATA:- A data is a raw fact
and unorganised form.
It didn't give knowledge about
the raw fact or unorganised
material.
Example :- Take a example of a
game "PUZZLE". It is an
unorganised form. At this time
it is a Data.

5. INFORMATION:- An
information is an organised
form of data that give
knowledge.
EXAMPLE:- In previous we
see that a puzzle is an
unorganised but now it is in
organised form known as
information.

6. DATA STRUCTURE (D S)
Classification of Data structure

7. DATA STRUCTURE
PRIMITIVE DATA STRUCTURE :- These are the
predefined data structure and directly operated by the
machine instruction.
Operations like Insertion, deletion, selection and
updation can be carried out on primitive data structure.

8. DATA STRUCTURE
Some of the primitive data structure are -
1. Integer:- This is used to represent a number without
decimal point.
example- 11 , 15 , 19 etc.
2. float:- This is used to represent a number with decimal point.
example:- 11.4 , 4.5 , 99.5 etc.
3. character:- This is used to represent a single character like
A, B , C etc.
4. String:- this is used to represent a group of character like
COMPUTER, CLASS etc.

9. DATA STRUCTURE
NON-PRIMITIVE DATA STRUCTURE:- These data structure
are derived form the primitive data structure and these are type of
user defined.
These type are used to store group of value.
Non-primitive are further classified into two categories -
1. Linear data structure
2. Non- linear data structure

10. DATA STRUCTURE
Linear data structure:- some of the linear data structure are -
1. Array:- It is a collection of homogenious elements.
2. Link list :- The element of list can be placed anywhere in
the memory.These element are link with one
another.A information field and link field (pointer).

11. DATA STRUCTURE
3. Stack:- A stack is a list of element in which insertion and
deletion are made at one 'end' called the top of the stack.
- LIFO[ last in first out]
INSERTION DELETION
TOP of Stack = 4
A
B
C
D

12. DATA STRUCTURE
4. QUEUE:- A Queue is a list of element in which insertion are made at
one end known as Rear & deletion are made at one end known as front.
DELETION INSERTION
A B C D E F G
FRONT REAR

13. DATA STRUCTURE
Non-Linear Data structure:- There are two types-
1 Tree:- Tree are used to represent data that has some
hierarchical relationship among the DATA Elements.

14. DATA STRUCTURE
Graph :- A graph is a collection of Vertics (V)
and Edges (E).
It is represented as G=(V,E).
A B
C D
E