Prog Method

 Data structure is the structural representation of logical relationships between

elements of data.
 Data structure mainly specifies the structured organization of data, by

providing accessing methods with correct degree of associativity.
 Data structure affects the design of both the structural and functional aspects

of a program. Algorithm + Data Structure = Program
 Data structures are the building blocks of a program.  The programmers have to strive hard to solve these problems.  If the problem is analyzed and divided into sub problems, the task will be

much easier i.e., divide, conquer and combine.

 A complex problem usually cannot be divided and programmed by set of

modules unless its solution is structured or organized.
 Thi is because when we divide the big problems into sub problems, these sub

problems will be programmed by different programmers or group of programmers.
 But all the programmers should follow a standard structural method so as to

make easy and efficient integration of these modules.
 Such type of hierarchical structuring of program modules and sub modules

should not only reduce the complexity and control the flow of program statements but also promote the proper structuring of information.
 By choosing a particular structure (or data structure) for the data items, certain

data items become friends while others loses its relations.
 The representation of a particular data structure in the memory of a computer

is called a storage structures.
 That is, a data should be represented in such a way that it utilizes maximum

efficiency.
 The data structure can be represented in both main and auxciliary memory of

the computer.
 A storage structures representation in auxiliary memory is often called a file

structures.

 It is clear from the above discussion that the data structure and operations on

organized data items can integrally solve the problem using a computer Data Structure = Organized Data + Operations

