1
Data Structure & Algorithms
Data structure
Data structure is a way of storing and organizing data efficiently such that the required operations
on them can be performed be efficient with respect to time as well as memory. Simply, Data
Structure are used to reduce complexity of the code.
Data structures can be two types
1. Static Data Structure 2. Dynamic Data Structure
1. Static Data Structure
In Static data structure the size of the structure is fixed. The content of the data structure can
be modified but without changing the memory space allocated to it. Example of Static Data
Structures: Array
2. Dynamic Data Structure
In Dynamic data structure the size of the structure in not fixed and can be modified during the
operations performed on it. Dynamic data structures are designed to facilitate change of data
structures in the run time. Example of Dynamic Data Structures: Linked List
Static Data Structure vs Dynamic Data Structure
Static Data structure has fixed memory size whereas in Dynamic Data Structure, the size ca n be
randomly updated during run time which may be considered efficient with respect to memory
complexity of the code. Static Data Structure provides easier access to elements with respect to
dynamic data structure. Unlike static data structures, dynamic data structures are flexible.