Question

Short Answer.

Under what conditions are adding or removing an element in a linked structure an O(1) operation?

Under what conditions are adding or removing an element in an array-based structure an O(1) operation?

How does the memory usage of an array-based structure compare to a linked structure?

what structure/implementation would be the best choice for managing a collection where the order is not important, but the user needs frequent access to elements within the collection? Explain your choice.

Answer 1

ANSWER:

a) In Linked structure, adding or removing element is O (1):

• If we have the addition and removal of element is complete at initial element pointed by HEAD hand. Or else traversal to the element to execute operation will get O (n) time in worst case.
• Or if a indicator is there pointing to the element to wherever insertion or deletion is perform it will take O (1)

b) In array structure, as the address is continuous

• If directory of the element is known to be inserted or delete, it determination take O (1) time (if broken up is overlooked), but the changing of element will take O (n-m) {m is the figure of elements to the right of nth element}.

c) Memory usage of linked structure is better than array structure,

• Array structure has permanent amount and cannot be customized in program, accordingly if a reduced amount of fundamentals in attendance in group will cause consumption of recollection as memory needed is permanent before hand.
• In connected construction the memory is owed dynamically every time new node is additional to it and deallocated when component is removed from connected structure.
• But, at what time there is no consumption of recollection in array (by means of full size) , array has better recollection usage than linked organization as linked organization takes more memory to store pointer changeable (it can be 2x or 3x than array).

d) Array structure can be used when order is not important and the user needs frequent access to elements withing the collection as:

• The array construction has adjacent memory arrangement and any component can be at random accessed using directory of the constituent without any other additional cost or over head metadata.
• While in connected list there be supposed to always a traversal instrument which make to costly, and fundamentals cannot be arbitrarily admittance.