Data: Data is collection of raw facts, figures, audio, text or any representation of real world which has some implicit or hidden meaning.
Structure: Structure is the arrangement of the basic components or building blocks which is representation for laying the foundation of the system. It also gives relationship or ordering of all its building blocks.
Data Structures: Data Structures is an unordered set which is responsible for storing the data in convenient way in computer memory. It provides the following facilities to the user.
Define Data Structures: It enables the users to define basic data structures definition by using the mechanism of programming language.
Insertion:
It is a basic
operation of the Data Structures, which provides mechanism to add an extra
element to existing the data structure such that the properties definition
restriction of data structure remains conserve.
Search:
It is the basic
operation of data structure which returns the address of element if it is
present in the data structures and it returns a null pointer if the element is
not present in the data structure. In doing so search operation explored the
underline property of data structures in order to minimized search time.
Deletion:
It is an
operation of data structure which requires searching for the element. Deleting,
deallocating the particular element occupy memory such that the underlying
properties definition of data structures remains conserved.
Used
of Data Structures:
A Data
Structures finds used it in many situations where essential principles of Computer Science need to be implemented.
In
Design of Operating System:
We requires data structure like
·
Linked
List data structures for Process Control Block
·
Priority
queue data structures for implementing priority scheduling
·
First
in first out queue also known as pipe data structure to perform first come
first serve CPU Scheduling of processors etc.
In
Computer Network:
We make use of data structure to establish a
connection from source node to destination node in connection oriented services
the data structure used is FIFO Queue.
In Microprocessor:
Every microprocessor make used of a
stack data structure for
o
Expression
inter convention form
Postfix
ßà Prefix ßà Infix
o
Expression
Evaluation
o
Implied
Mode:
In implied mode one of the ways
is to make used of stack and data or instruction on top of stack is implied to
be access need.
In
General:
In general a specific kind of data structure can be
used where real world problem is solved using computer.
o Sorting: It makes used of data
structure known as array.
o Matrix Operation: Like two dimensional arrays.
o Searching : Which
makes used of an array in case of linear search or a sorted array or a binary
search in case of binary search.
 |
| Data Structures |
0 comments: