Approach towards Data Structures: It’s Implementation and Applications

Data structure is a well known technique of organizing the various elements of data in any system for using it for computational problems effectively (for instance; storing list of variables with similar data-type using the concept of arrays, etc). Usually programs are comprised of two things namely- (a) data, and (b) algorithms. The algorithms describe the way in which the data is transformed. Therefore, having knowledge about these is a necessity as adding the different kinds of structured to the assigned data to make various algorithms simpler, easier to maintain and understand as well as faster to execute. The paper deals with the briefing of various Data – Structures (it’s various types like arrays, linked lists, also stacks, queues for the linear DS while trees and graphs for few of the non linear DS), about their different levels of its implementation. The paper will also give the knowledge of its various applications like – in storing lists of elements which are containing the data, auxiliary storage for other data – structures, storage of matrices. At last the paper will try to come up with the basic framework of few of the concepts of data structures, its levels of implementations and also with the applications which can be used effectively and end by giving some of the real-life applications of data structures.