Data Structure can be defined as the group of data elements which provides an efficient way of storing and organizing data in the computer so that it can be used efficiently. Some examples of Data Structures are arrays, Linked List, Stack, Queue, etc.
Data Structures are the main part of many computer science algorithms as they enable the programmers to handle the data in an efficient way.
Data is organized to form a data structure in such a way that all items are not required to be searched.
Advantages of Data Structures
Efficiency: Efficiency of a program depends upon the choice of data structures.
For example: a search for a particular record has to be performed on some data. If data is organized in an array, search has to be performed sequentially element by element. Hence, using array may not be very efficient here. There are better data structures which can make the search process efficient like ordered array, binary search tree or hash tables.
Reusability: Data structures are reusable, i.e. once implemented a particular data structure can be used at any other place. Implementation of data structures can be compiled into libraries which can be used by different clients.
Abstraction: Data structure is specified by the ADT which provides a level of abstraction. The client program uses the data structure through interface only, without getting into the implementation details.
0 comments:
Post a Comment