Friday, 13 May 2016

Data Structure & Algorithms

Data Structures are the programmatic way of storing data so that data can be used efficiently. Almost every enterprise application uses various types of data structures in one or other way.
Data Structure is a systematic way to organize data in order to use it efficiently. Following terms are foundation terms of a data structure.

Interface − Each data structure has an interface. Interface represents the set of operations that a data structure supports. An interface only provides the list of supported operations, type of parameters they can accept and return type of these operations.

Implementation − Implementation provides the internal representation of a data structure. Implementation also provides the definition of the algorithms used in the operations of the data structure.

Characteristics of a Data Structure
Correctness − Data Structure implementation should implement its interface correctly.

Time Complexity − Running time or execution time of operations of data structure must be as small as possible.

Space Complexity − Memory usage of a data structure operation should be as little as possible.

No comments:

Post a Comment