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

Your posts are moderated

Write your message here..

Related Questions

Algorithm that inputs the codes for all items in stock, A shop sells books,... A shop sells books, magazines and maps. Every item is identified by a unique 4 - digit code. All books have a code which starts with 1, all maps have a code starting with 2 and all

What are the specific needs for realism, Normal 0 false false... Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Asymptotic notation, Asymptotic notation Let us describe a few function... Asymptotic notation Let us describe a few functions in terms of above asymptotic notation. Example: f(n) = 3n 3 + 2n 2 + 4n + 3 = 3n 3 + 2n 2 + O (n), as 4n + 3 is of

HASHING, MID SQUARE METHOD MID SQUARE METHOD

Write an algorithm of value in tax using pseudocode, A town contains a tota... A town contains a total of 5000 houses. Every house owner has to pay tax based on value of the house. Houses over $200 000 pay 2% of their value in tax, houses over $100 000 pay 1.

Data structure queue, In this unit, we described about the data structure Q... In this unit, we described about the data structure Queue. It had two ends. One is front from where the elements can be removed and the other is rear where the elements can be inse

Complexity of an algorithm, An algorithm is a sequence of steps to solve a ... An algorithm is a sequence of steps to solve a problem; there may be more than one algorithm to solve a problem. The choice of a particular algorithm depends upon following cons

What is gouraud shading, Gouraud Shading The faceted appearance of a La... Gouraud Shading The faceted appearance of a Lambert shaded model is due to each polygon having only a single colour. To avoid this effect, it is necessary to vary the colour ac

Example which cause problems for hidden-surface algorithms, Example which c... Example which cause problems for some hidden-surface algorithms Some special cases, which cause problems for some hidden-surface algorithms, are penetrating faces and cyclic ov

Creation of Heap, Q. Create a heap with the given list of keys: ... Q. Create a heap with the given list of keys: 8, 20, 9, 4, 15, 10, 7, 22, 3, 12                                                  Ans: Creation