Data Structure |
|
|
Data Structure is a way of storing data in a computer so that it can be used efficiently. A logical or mathematical model of a particular organization of data is called data structure.
Data Structure Operations
Following are the data structure operations
- Traversing: accessing each record exactly once.
- Searching: Finding the location of the record with a given key value or finding the location of all records which fulfil a certain condition.
- Inserting: Adding a new record into the data structure
- Deleting: Deleting record from the data structure
- Sorting: Arranging the records in some logical order.
- Merging: Combining the records in two different sorted lists into one sorted list.
Algorithm
A set of ordered steps for solving a problem, such as a mathematical formula or the instructions in a program.
An algorithm is a well defined list of steps for solving a particular problem.
Complexity
Complexity comprises the study of computational models, its inherent power or limitations, and the precise description of the problems to be solved.
|
|
|
|
|
|
|
|
| Data Structure Theory Tutorial |
|
| |
|
| |
| |
|
|
|
|
| |
| |
|
|
|
