Data Structure

Data Structure is a representation of the logical

relationship among indivisual element of data.
Data Structure may be defind as logically arranged data
plus allowed operation.
Type
1.linear
2.non linear
Linear data type
It includes stacks and queues
Non linear
It includes trees and graphs
Memory allocation
Memory blocks are allocated for program entities during
execution phase. Allocation of memory blocks is done
randomly inside the RAM.
Memory allocation is of two types
1. Static memory allocation
2. Dynamic memory allocation
Static memory allocation
Memory is allocated to the entities by the Operating
System. Once the memory blocks are allocated to the
entities .they may reserved till the end of the program
.Such such a memory allocation for arrays is called static
memory allocation.

Dynamic memory allocation

Memory is allocated dynamically to the entities of the
program .Programmer has freedom to allocate and free
the memory for the program entities. Such a memory
allocation is called dynamic memory allocation.
DEFINATION
A data structure is a logical model of a particular
organization of data. The programs have to follow certain
rules to asses and process the structured data. Therefore
data structure is represented as:
Data structure = Organized data + Allowed
operation
The study of data structures deals with the following:
1. Logical description of the data structure
2. Implemention of the data structure
3. Quantitative analysis of structure of data.