The advantage of list over Arrays is flexibility. Over flood is not a problem until the computer memory is bushed. When the individual record are quite large, it may be difficult to determine the amount of next storage that may be in need for the required arrays. With dynamic allocation, there is no need to effort to allot in advance. Changes in list, placing and deletion can be made in the central point of the list, more speedily than in the nearby lists.

The drawback of lists is that the link themselves take room which is in count to the space that may be wanted for data. One more disadvantage of lists is that they are not right for random access. With lists, we need to go across a long path to reach a desired node.

Posted Date: 4/11/2013 3:10:02 AM | Location : United States

Ask an Expert

Related Discussions:- Advantage of list over arrays, Assignment Help, Ask Question on Advantage of list over arrays, Get Answer, Expert's Help, Advantage of list over arrays Discussions

Write discussion on Advantage of list over arrays
Your posts are moderated

Write your message here..

Related Questions

find shortest path from a to z using dijkstra''s algorithm., Q.  In the gi... Q.  In the given figure find the shortest path from A to Z using Dijkstra's Algorithm.    Ans: 1.  P=φ;  T={A,B,C,D,E,F,G,H,I,J,K,L,M,Z} Let L(A)

FIRST function in the compiler construction, I need a recursive algorithm t... I need a recursive algorithm to implement the FIRST function to any grammar

Importance of object-oriented over java, Importance of Object-Oriented over... Importance of Object-Oriented over java Java is basically based on OOP notions of classes and objects. Java uses a formal OOP type system that should be obeyed at compile-t

What do you understand by structured programming, What do you understand by... What do you understand by structured programming Structured Programming  This term is used for programming design that emphasizes:- (1) Hierarchical design of programmi

Shortest path algorithms, A driver takes shortest possible route to attain ... A driver takes shortest possible route to attain destination. The problem which we will discuss here is similar to this type of finding shortest route in any specific graph. The gr

Write algorithm for post-order traversal, P os t - o r d e r T ... P os t - o r d e r T r av er sal :  This can be done by both iteratively and recursively. The iterative solution would require a modification or alteration of the in-

What is keyed access- container, What is Keyed Access- Container A c... What is Keyed Access- Container A collection may allow its elements to be accessed by keys. For instance, maps are unstructured containers which allows their elements to be

Explain the sum of subset problem, a. Explain the sum of subset problem. Ap... a. Explain the sum of subset problem. Apply backtracking to solve the following instance of sum of subset problem: w= (3, 4, 5, 6} and d = 13. Briefly define the method using a sta

Determine the components of illumination, Determine the Components of Illum... Determine the Components of Illumination The light reaching the eye when looking at a surface has clearly come from a source (or sources) of illumination and bounced off the su

Which sorting algorithms not have running time of o (n2), Which sorting al... Which sorting algorithms does not have a worst case running time of  O (n 2 ) ? Merge sort