Tuesday, February 26, 2013

1.1 INTRODUCTION

A data structure in computer science is a way of storing data in a computer so that it can be used efficiently.It is an organization of mathematical and logical concepts of data. A well defined datda structure a variety of critical operations to be performed using a few resources, both exection time and memory space, as possible. Data structures are implemented by a programming language as data types and the references and operations they provide.
  Data structure is a way of organizing the all data items that considers not only the element stored but also their relationship to each other. data structures usually consists of two things : first one is the type of structure that we are going to used to store data and second hoe efficiently we perform operation on to the data stored in structure so that it result in less execution time and amount of memory they require. So by this way we can say that data structure is one collection of data structures.
Data structure mainly classify the following features:~
1. Organization of data.
2. Logical or mathematical model of data.
3. Accessing Methods of data.
4. Implementation of an abstract data type.
5. Degree of associativity.
6. Processing alternatives for information.
7. Dynamic memory allocation.
Data structure are the building   block of the programs and hense the choice of a particular data model or structure depends on the following features:~
* Data structure must be rich enough in structure to reflect the actual relationship of the data
* And second one structure should be simple (not complex to understand) enough that any one can process  data easily whenever required.

A program is make by the combination of the algorithm and the data structure. SO we can write as:
data structure + algorithm = program
Notes :~ Algorithm is the step by step solution of a program.
To develop a program of  an algorithm

No comments:

Post a Comment