DATA STRUCTURES

Data Structures

Data Structures

What problems are forced if one tries to put into practice a active list using a usual homogeneous array?

All the list elements are stored closely in an array. The insertion and deletion would require the shifting of all the elements with the inserting and deleting point. The movement of data which has an excessive quantity can be a concern when the running applications are time sensitive.

The array has to be pre assigned in order to hold the highest number of elements. In case this is not possible then any insertion that would cause an array capacity to increase to be failed or will be automatically extend the list through assigning a larger array and then copying all the elements from the original one. The pre assigning of space for every element can also be a concern if the working environment has low memory allocation.

The dynamic list in case of adding a new element is disturbed. To avoid this, insertion and deletion process is necessary and is to be kept up to date in order to add new elements.

presume an array with six rows and eight columns is accumulated in a row major method that is starting at the address 20 (base 10). If each entry in the array demands only a single memory cell, what is the address of the entry in the third and fourth column? What if every entry demands two cells?

In an array each data stored would have a unique address. The addressing is a zig zag method that start from points (0, 0) and ends at (n, n)

Now

If one memory cell is being addressed then

( 3 , 4 ) => 20 + 8 * ( 3 - 1 ) + ( 4 - 1 ) = 39

If two memory cells are ...