Definition of List and Linked List

List is a generic term for a collection of objects. It may or may not contain duplicates and application may or may not require that it be kept in specified order.

The functions defined to operate on a list are


·         Insert:  Insert a new entry into a list
·         Delete: Delete an entry from list
·         Length: Compute length of a list
·         Next: Return the next element in a list
·         Search: Search if an element is in a list

Linear list: A linear list is a sequence of n>=0 nodes x[1], x[2], x[3] ……………x[n] whose essential structural properties between items as they appear in a line.

Restricted list: In restricted list, Data can only be added or deleted at the ends of a structure and processing is restricted to operations at the end of lists.

The two restricted list structures are First In First Out (FIFO) stacks and Last In First Out (LIFO) queue.

The four operations performed on linear lists are


         i.            Insertion
       ii.            Deletion
      iii.            Retrieval
     iv.            Traversal


         Depending on the type of linear list, an insertion can be made at the beginning of the list, or at the end of the lists. When inserting data into ordered list, the data must be inserted so that the ordering is maintained. Deletion from general lists requires that the list be searched for the data to be deleted.



List retrieval requires that data be located in a list and presented to the calling module without changing the contents of the lists.


List traversal is a special case of retrieval in which all the elements are retrieved in a sequence.

Definition of Linked list


A link list is a collection of records, called nodes, each containing at least one field(member) that gives the location of the next node contains two members; a data member (the value of the list item) and a link member (a value locating the next node).The link list is a very flexible dynamic data structure. It is a low-level structure upon which high-level data structures can be built.

The Typical basic linked-list operations are


         i.            Create: Makes a new linked list
       ii.            Insert: Puts a new node in its place in the list.
      iii.            Remove: Remove a node from the list.
     iv.            Traverse: This function allow user to visit each node in the list.
       v.            Is empty: The function returns a true/false indication of whether or not there are any nodes in the list.
     vi.            Is full: This function returns a true/false indication of whether or not the list is full

Types of linked lists


         i.            Singly linked lists
       ii.            Circular singly linked lists
      iii.            Doubly linked lists
     iv.            Circular Doubly linked lists


You Might also view the following Related Posts

For more other Posts: Click Here


Popular posts from this blog

MCQ of Structured Query Language(SQL) With Answer Set -2

1. Which of the following query is correct for using comparison operators in SQL ? A) SELECT sname, coursename FROM studentinfo WHERE age>50 and <80; B) SELECT sname, coursename FROM studentinfo WHERE age>50 and age <80; C) SELECT sname, coursename FROM studentinfo WHERE age>50 and WHERE age<80; D) None of the above 2.How to select all data from studentinfo table starting the name from letter 'r'? A) SELECT * FROM studentinfo WHERE sname LIKE 'r%'; B) SELECT * FROM studentinfo WHERE sname LIKE '%r%'; C) SELECT * FROM studentinfo WHERE sname LIKE '%r'; D) SELECT * FROM studentinfo WHERE sname LIKE '_r%'; 3. Which of the following SQL query is correct for selecting the name of staffs from 'tblstaff' table where salary is 15,000 or 25,000? A) SELECT sname from tblstaff WHERE salary IN (15000, 25000); B) SELECT sname from tblstaff WHERE salary BETWEEN 15000 AND 25000; C) Both A and B D) None of the above 4. The SELECT
Read more

Easy Methods to Increase Your Website Speed

Website speed is the most important factor for SEO. It also affects the popularity of your site, about every 25% of the visitors of the site left that even if it is useful for them for slow loading sites. Google also decided to include website loading speed for website ranking.  You can increase your website by performing testing or analyzing your site by using different such tools and performing the actions suggested by them. The main tasks to be performed to achieve such goals are setting an expiry date or maximum age in the HTTP headers, minimizing the HTTP redirects, minimizing the amount of JavaScript need while loading the page, minimizing unnecessary JavaScript, CSS Scripts and HTML, Optimizing images and long running scripts etc.  Why Website Speed is Most Important For SEO?  Only the fast loading websites can achieve better user experience and can have the minimum exit ratio. They can only achieve their goals in their online business and marketing. Search engine crawlers also
Read more

Solved MCQ on Stack and Queue in Data Structure set-1

1) ......... form of access is used to add and remove nodes from a queue. A. LIFO, Last In First Out B. FIFO, First In First Out C. Both a and b D. None of these 2) In liked representation of stack ....... holds the elements of the stack. A. INFO fields B. TOP fields C. LINK fields D. NULL fields 3) ........ form of access is used to add remove nodes from a stack. A. LIFO B. FIFO C. Both A and B D. None of these 4) In the linked representation of the stack ......... behaves as the top pointer variable of stack. A. Stop pointer B. Begin pointer C. Start pointer D. Avail pointer 5) New nodes are added to the ......... of the queue. A. Front B. Back C. Middle D. Both A and B 6) In linked representation of stack the null pointer of the last node in the list signals .......... A. Beginning of the stack B. Bottom of the stack C. Middle of the stack D. In between some value 7) What happens when you push a new node onto a stack? A. The new node is placed at the front of the linked list B. The
Read more