Data Structure
Data Structure: Arrangement is a mathematical or logical way of organizing data in memory. The arrangement doesn't represent
only data in memory but it also represents the
connection among the
info that's stored in memory.
1. Primitive
Data Structure
2. None Primitive Data Structure
Array 
The info Structure which isn't directly
operated by machine level instruction is
understood as Non Primitive arrangement .
Non Primitive arrangement springs from
Primitive arrangement .
Non Primitive arrangement are
classified into two categories:
·
Linear
Data Structure: The Data Structure in which elements are arranged such that we
can process them in a linear fashion is called a linear data structure. Ex. Array,
stack, queue, linked list.
Stack 
· None
Linear Data Structure: The Data Structure in which elements are arranged such
that we cannot process them in a linear fashion is called the NonLinier data
structure. NonLinier arrangement are
useful to represent more complex relationships as compared to linear data
structures. Ex. Tree, graph.
Difference between NonLinear Data structure and Linear Data Structure
NonLinear Data structure

Linear Data Structure

Processing

Processing

Easy to implement.

Difficult to implement.

Example: Array, Stack, Queue

Example: Tree, Graph

Graph
Difference between NonPrimitive Data Structure and
Primitive Data Structure
NonPrimitive Data Structure

Primitive Data Structure

The

The

All Primary data types are known as Primitive Data
Structure.

Non Primitive

Example: integer, float, character.

Example: array, stack, queue, tree.

Post a comment
Please do not enter any spam link in the comment box.