LINEAR LIST :-Linear list is a data object whose instances are of form (e1,e2,e3,….,eN) where,N is length of the list.

Ex:words sorted in dictionary order,list of marks in descending order…

Here  linear list is a data structure to implement it we use four data representations which are:

1.Formula-based :-Uses a mathematical fornula to determine where to store each element of list(i.e, the memory address).We use arrays in this since their memory locations are in consecutive positions.

2.Link-based :-The elements of list may be stored in any arbitrary set of locations since each element has an explicit pointer(or link)to the next element.

3.Indirect addressing :-The elements of list may be stored in any arbitrary locations since we maintain a table such that the Mth table entry tells us where the Mth element is stored.

4.Simulated pointer :-Similar to link-based representation but integers replace the C++ pointers.

So i think many of you guys&gals came to know what is meant by linear list and how we implement it using different data representations.So don’t get confused that linear list and linked list are two types of data structures but linear list is a data structure and linked list is implementation of linear list using link-based representation.

I am much awaiting to listen your comments,requests for programs and suggestions so just feel free to write to me.