what is the difference between a linear linked list and a circular linked list?
for arrays you can list the different arrays and what attributes that you give to them.
compare difference between static and dynamic implementation of linked list.
Array is a simple sequence of numbers which are not concerned about each-others positions. they are independent of each-others positions. adding,removing or modifying any array element is very easy.Compared to arrays ,linked list is a comlicated sequence of numbers.each number in the linked list is connected to its previous & next no. via a link which is nothieng but a pointer.Addition,removal of no.s in linked list is related to this pointer direction & linking that no. to the no. which is already present in the list.
To store similar type linear data, linked list or array is used. Linked list has two major advantages over arrays which are ease of deletion and insertion and dynamic size.
LINEAR STRAIGHT CIRCULAR CURVED
A singly-linked list offers forward traversal only. A doubly-linked list offers bi-directional traversal.
I assume you are referring to implementation of Abstract Data Types like Stacks and Queues. Arrays have capacity limits which you set upon declaring them. If you have date which has a definite size, then using arrays is okay. But if you have data which size changes at runtime, then just use linked lists because linked lists could constantly add nodes whenever needed. arrays need continuous memory allocation for their creation but in linked list the memory allocation need not be continuous....
Linear linked list is a data structure where the last element is linked to a null object. With circular linked list, the last element is linked to the first element.
Linked lists take extra memory for storing the addresses. Linked lists have an access time of O(n), arrays have an access time of O(1).
Typically when one refers to a "linked list" they are actually referring to a "singly linked list." Technically, however, "linked list" refers to the collection of all different implementations of linked lists: singly linked list, doubly linked list, circular linked list, circular double linked list, etc.
A linked list implemented with an array defeats the purpose of using a linked list, which is to address the memory allocation problems associated with arrays.