Manipulating Data Structures

Computer Science an overview _j Glenn brookshear _11th Edition

We have seen that the structures is actually stored in a computer ' s

Memory is not the same as the conceptual structure envisioned by the user. A two-dimensional homogeneous array is not actually stored as a two-dimensionalrectangular block, and a list or a tree MiG HT actually consist of small pieces scat-tered over a large area of memory. Hence, the user to access the structure as a abstract tool, we mustshield the user from the complexities of the Actual storage System. This meansthat instructions given by the user (and stated in terms of the abstract tool) Mustbe converted to steps that is appropriate for the actual storage system. In thecase of homogeneous arrays, we had seen how this can is done by using anaddress polynomial to convert row and Colum n Indices into memory celladdresses.

Manipulating Data Structures