Topic:
Classification of
Data Structure
2
Data Structure
What is Data Structure? Why are we learning Data
Structure?
A data structure is a data
organization, management, and
The reason for learning about data
storage format that enables efficient
structures is because adding
access and modification. More
structure to our data can make the
precisely, a data structure is a
algorithms much simpler, easier to
collection of data values, the
maintain, and often faster.
relationships among them, and the
functions or operations that can be
applied to the data.
3
How do we classify
Data Structure?
4
Data Structure can be
classified on the basis of
various characters.
5
Data
Structure
Non-
Primitive
Primitive
Non-
Integer Linear
Linear
Character Array Graph
Float Linked List Tree
Boolean Stack
Queue
6
Data
Structure
Non-
Primitive
Primitive
Data Structure is divided into two main
categories.
7
Primitive Data Structure
The primitive data structure are defined that can be
manipulated or operated by the machine instruction. It
is of four types:
Integer- e.g: 1,2,3,4.....
Character- e.g: a,s,f,sum,add,e.t.c
Float- e.g: 3.14,e.t.c
Boolean- e.g: True, False
8
Non-Primitive Data Structure
The non-primitive data structures are data structure
that cannot be manipulated or operated directly by
the machine instructions.These are more
sophisticated data structures.These are derived from
the primitive data structure. Non-
Primitive
Non-
Linear
Linear
9
Two types of Non-Primitive Data Structure
1. Linear Data Structure 2. Non-Linear Data
A linear data structure Structure
traverses the data elements Every data item is attached to
sequentially, in which only one several other data items in a
data element can directly be way that is specific for
reached. reflecting relationships. The
data items are not arranged in
a sequential structure.
10
Linear Data Structure
They can be implemented in memory using two ways.
1. By having a linear relationship between elements by means
of sequential memory locations.
2. By having a linear relationship by using links.
Linear
Array Linked list Stack Queue
11
I. ARRAY: An array is a collection of items stored at
contiguous memory locations. The idea is to store multiple
items of the same type together.
II. LINKLIST: A linked list is a linear data structure, in
which the elements are not stored at contiguous memory
locations. The elements in a linked list are linked using
pointers as shown in the below image:
12
III. STACK: Stack is a linear data structure which follows a
particular order in which the operations are performed. The
order may be LIFO(Last In First Out) or FILO(First In Last
Out).
13
IV. QUEUE: A Queue is a linear structure which follows a
particular order in which the operations are performed. The
order is First In First Out (FIFO).In a queue, we remove the
item the least recently added.
14
Non-Linear Data Structure
A non-linear data structure is a data structure in which a data
item is connected to several other data items. So that a given
data item has the possibility to reach one-or-more data items.
Non-
Linear
Graph Tree
15
I. Graph: A Graph is a non-linear data structure consisting
of nodes and edges. The nodes are sometimes also referred
to as vertices and the edges are lines or arcs that connect
any two nodes in the graph. More formally a Graph can be
defined as a finite set of vertices(or nodes) and set of Edges
which connect a pair of nodes. .
16
II. Tree: A tree is similar to linked list, but each node can be
connected to multiple nodes. When we talk about tree,
mostly we mean binary tree that is a structure that has two
children, left and right. A node of a binary tree is represented
by a structure containing a data part and two pointers to
other structures of the same type.
17
This is not a part of the ppt jst kept if
needed for any changes
White Gray Black
18
This is not a part of the ppt jst kept if
needed for any changes
Lorem ipsum
tempus
Lorem ipsum congue
tempus
19
This is not a part of the ppt jst kept if
needed for any changes
first second last
2
0
Importance of Data Structure
Stores data Manages large Manipulates stored
systematically amount of data in an data effortlessly
efficient way
Arranges data Efficient code for Helps in accessing
according to user's solving problems data easily
need
21
Thanks! 😉
Any questions?
22
Made by
Vaishnavi
23
Isn’t that nice? :)
This is not a part of the ppt jst
kept if needed for any
changes
24
😉
This is not a part of the ppt jst kept if needed for any changes
https://twitter.com/googledocs/status/730087240156643328
✋👆👉👍👤👦👧👨👩👪💃🏃💑❤
😂😉😋😒😭👶😸🐟🍒🍔💣📌📖🔨
🎃🎈🎨🏈🏰🌏🔌🔑 and many more...
