Introduction to Data Structure

Data structure is the representation of the logical relationship existing between individual elements of data. Data structure specifies: organization of data, accessing methods, degree of associativity, and processing alternatives for information. Data structure can be broadly classified into two categories as linear and non-linear. Mathematically Algorithm + Data Structure = Program. Efficiency of an algorithm can be determined by measuring the time, space, and amount of resources it uses for executing the program. The efficiency of an algorithm depends on the time and space complexities. The asymptotic notations are the symbols which are used to solve the different algorithms and the notations are big oh notation, little oh notation, omega notation, and theta notation.