DATA STRUCTURE

1. CLASSIFICATION OF DATA
STRUCTURE
By,
LAKSHMI.S,MCA.,M.Phil,
Assistant Professor in Dept. of Computer Science,
Sri Adi Chunchanagiri Women’s College, Cumbum.

2. Data Structure Classification

3. Primitive data structure :
The primitive data structures are known as basic data structures. These data
structures are directly operated upon by the machine instructions. Normally,
primitive data structures have different representation on different computers.
Example of primitive data structure :
 Integer
 Float
 Character
 Pointer

4.  INTEGER : It is a Data type which allows all
values without fraction part. We can use it for whole
numbers.
 FLOAT : It is a Data type which use for storing
fractional numbers.
 CHARACTER : It is a data type which is used for
character values
 POINTER : A Variable that holds memory address
of another variable are called pointer.

5. Non-Primitive data structure :
The non-primitive data structures are highly developed complex data structures.
Basically, these are developed from the primitive data structure. The non-primitive
data structure is responsible for organizing the group of homogeneous and
heterogeneous data elements.
Example of Non-primitive data structure :
 Arrays
 Lists
 Files

6. Arrays :
Arrays are the set of homogeneous data elements stored in RAM. So, they can hold only one
type of data. The data may be all integers, all floating numbers or all characters. Values in
an array are identified using array name with subscripts. Single sub-scripted variables are
known as a one-dimensional array or linear array; two sub-scripted variables are
referred as a two-dimensional array.
One Dimensional Array
Two-dimensional array

7. Lists
A list is a collection of a variable number of data items. Lists fall in the non-primitive type
of data structure in the classification of data structure. Every element on a list contains at
least two fields, one is used to store data and the other one is used for storing the address of
next element.
Linear linked lists

8. Files
Files contain data or information, stored permanently in the secondary storage
device such as Hard Disk and Floppy Disk. It is useful when we have to store
and process a large amount of data. A file stored in a storage device is always
identified using a file name like HELLO.DAT or TEXTNAME.TXT and so
on. A file name normally contains a primary and a secondary name which is
separated by a dot(.).
Files

9. Stack
 Like arrays, a stack is also defined as an ordered collection of elements. A stack is a
non-primitive linear data structure having a special feature that we can delete and
insert elements from only one end, referred as TOP of the stack. The stack is also
known as Last In First Out (LIFO) type of data structure for this behaviour.
 When we perform insertion or deletion operation on a stack, its base remains
unchanged but the top of the stack changes. Insertion in a stack is called Push and
deletion of elements from the stack is known as Pop.
 We can implement a stack using 2 ways:
 Static implementation (using arrays)
 Dynamic implementation (using pointers)
Stack

10. Queues
 Queues are also non-primitive linear data structure. But unlike stacks, queues
are the First In First Out (FIFO) type of data structures. We can insert an
element in a queue from the REAR end but we have to remove an element from
the only FRONT end.
 We can also implement queues using 2 ways :
 Using arrays
 Using pointers
Queue

11. Trees
Trees fall into the category of non-primitive non-linear data
structures in the classification of data structure. They contain a
finite set of data items referred as nodes. We can represent a
hierarchical relationship between the data elements using trees.
A Tree has the following characteristics :
 The top item in a hierarchy of a tree is referred as the root of the
tree.
 The remaining data elements are partitioned into a number of
mutually exclusive subsets and they itself a tree and are known
as the subtree.
 Unlike natural trees, trees in the data structure always grow in
length towards the bottom.
Trees

12. Graph
Graph falls in the non-primitive non-linear type of data structure in the classification
of data structure. Graphs are capable of representing different types of physical
structures. Apart from computer science, they are used broadly in the fields of
Geography, Chemistry & Engineering Sciences.
 A graph normally a combination of the set of vertices V and set of edges E.
The different types of Graphs are :
 Directed Graph
 Non-directed Graph
 Connected Graph
 Non-connected Graph
 Simple Graph
 Multi-Graph

13. THANK YOU