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
write a pseudocode to input the top speed (in km''s/hours) of 5000 cars output the fastest speed and the slowest speed output the average (mean) speed of all the 5000 cars answers

Define the term counting - Pseudocode Counting in 1s is quite simple; use of statement count = count + 1 would enable counting to be done (for example in controlling a repeat

c program to represent a graph as an adjacency multilist form

Question 1 Write a program in 'C' to read N numbers and print them in descending order Question 2 Discuss the properties of ADT Question 3 Write a note on

Using the cohen sutherland. Algorithm. Find the visible portion of the line P(40,80) Q(120,30) inside the window is defined as ABCD A(20,20),B(60,20),C(60,40)and D(20,40)

Q. Describe what do you understand by the term array? How does an array vary from an ordinary variable? How are the arrays represented in the specific memory?

Explain an efficient and effective way of storing two symmetric matrices of the same order in the memory. A n-square matrix array will be symmetric if a[j][k]=a[k][j] for all j

A graph with n vertices will absolutely have a parallel edge or self loop if the total number of edges is greater than n-1

Ask question #explain it beriflyMinimum 100 words accepted#

How to measure the algorithm's efficiency? It is logical to examine the algorithm's efficiency as a function of some parameter n showing the algorithm's input size. Instance