⇒ Organised collection of data in particular format call data structures.
⇒ Data structure is a technique or method of study how the data are interacted to each other Logically, or mathematically .
⇒ The main aim of data structure is to increase the efficiency of program and decrease the storage requirement .
⇒ Linear data structure : Array , Linked List , Stack , Queue .
⇒ Non-linear data structure : Graph , Tree .
⇒ Homogeneous : Array
⇒ Non-homogeneous : Structure , Union .
⇒ STATIC : FIXED MEMORY SIZE
⇒ DYNAMIC : WE ARE WORKING WITH POINTER CHANGE THE MEMORY SIZE IN RUN TIMES
⇒ Searching , Traversing , Insert , Updating ,Deleting , Merging , Sorting
⇒ The step by step description of any program in general language is called algorithm .
⇒ Algorithm is a sequence of and clear instructions used to solving a problem such a way that it can implemented as a program for computer .
⇒ Input ,Output , Definiteness ,Effectiveness ,Finiteness.