Data Structure Introduction
Data structure is the representation of the logical relationship between individual elements of data. It is a way of organizing all data items that considers not only the elements stored but also their relationship to each other.
Data Sturcture Specifies :
1. Organizing of Data
2. Accessing Methods
3. Degree of Associativity
4. Processing alternatives for information
BASIC TYPE OF DATA STRUCTURE
Classification of Data Structure :
1. Primitive Data Structure
2. Non Primitive Data Strcuture
Primitive Data Structure
These are basic structures and are directly operated upon by the machine instructuions. These have different representation on diferent computers. Integer, floating point numbers, character constants , pointers etc fall in this category.
Non Primitive Data Structure
These are more sophisticated (Complex) data structures. The non primitive data structures emphasize on structuring of a group of homogeneous or hetrogeneous data items. Arrays, List, Stack, Tree, Queue and Files are in the list.
OPERATIONS ON DATA STRUCTURE
The Operations performed on data structures are :
2. Delete or Destroy
A well defined list of steps for solving a particular problem, which can be expressed either as an informal high level description as pseudocode or using a flowchart.
Algorithm name can be given by author Abu Jafar Muhammad ibn Musa 820 BC.
It is a finite set of instruction that is used to find the solution of a problem.