Advantage of list over arrays, Data Structure & Algorithms

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







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
Related Questions
1) What will call a graph that have no cycle? 2) Adjacency matrix of an undirected graph is------------- on main diagonal. 3) Represent the following graphs by adjacency matr

If a Dequeue is implemented via arrays, then this will suffer with the similar problems which a linear queue had suffered. Program 8 gives the array implementation of Dequeue.

What is Class invariants assertion A class invariant is an assertion which should be true of any class instance before and after calls of its exported operations. Generally

explain two strategies to implement state charts with the help of an example of each.

Which sorting methods would be most suitable for sorting a list which is almost sorted  Bubble Sorting method.

Explain the bubble sort algorithm. Answer This algorithm is used for sorting a list. It makes use of a temporary variable for swapping. It compares two numbers at an insta

Comp are two functions n 2    and  2 n  / 4  for distinct values of n.   Determine When s ec on d function b ec om es l a r g er th an f i r st functi

Handout 15 COMP 264: Introduction to Computer Systems (Section 001) Spring 2013 R. I. Greenberg Computer Science Department Loyola University Water TowerCampus, Lewis Towers 524 82

for (i = 0; i sequence of statements } Here, the loop executes n times. Thus, the sequence of statements also executes n times. Since we suppose the time complexity of th

There are ten stations on a railway line: Train travels in both directions (i.e. from 1 to 10 and then from 10 to 1).  Fare between each station is $2. A passenger input