A representation of an array structure is a mapping of the (abstract) array with elements of type T onto the store which is an array with elements of type BYTE. The array could be mapped in such a way that the computation of addresses of array elements is as simple as possible. The address i of the j-th array elements is computed by the linear mapping function

i = i0 + j*s

where i is the address of the first element, and s is the number of words that a element occupies. Assuming that the word is the smallest personally transferable unit of store, it is evidently highly needed that s be a whole number value, the simplest case being s = 1. If s is not a whole number, then s is generally rounded up to the next larger integer S. Each array component then accepts S words, whereby S-s words are left unused. Rounding up of the number of words required to the next whole number is called padding. The storage utilization factor u is the quotient of the minimal amounts of storage required to represent a structure and of the value actually used:

 

Posted Date: 7/27/2012 6:18:24 AM | Location : United States

Ask an Expert

Related Discussions:- Representation of arrays?, Assignment Help, Ask Question on Representation of arrays?, Get Answer, Expert's Help, Representation of arrays? Discussions

Write discussion on Representation of arrays?
Your posts are moderated

Write your message here..

Related Questions

Direct file organisation, It offers an effective way to organize data while... It offers an effective way to organize data while there is a requirement to access individual records directly. To access a record directly (or random access) a relationship is

File organization, Define File organization''s and it''s types Define File organization''s and it''s types

Multiple queue, algorithm for multiple queue with example program algorithm for multiple queue with example program

Circular queue, explain implementation of circular queue insert,delete oper... explain implementation of circular queue insert,delete operations

Red-black tree after insertion, The above 3 cases are also considered conve... The above 3 cases are also considered conversely while the parent of Z is to the right of its own parent. All the different kind of cases can be illustrated through an instance. Le

Determine about the post conditions assertion, Determine about the Post con... Determine about the Post conditions assertion A  post condition is an assertion which should be true at completion of an operation. For instance, a post condition of the squ

Determine the critical path and the expected completion, The information in... The information in the table below is available for a large fund-raising project. a. Determine the critical path and the expected completion time of the project. b. Plot the total

Asymptotic analysis, Asymptotic Analysis Asymptotic analysis is dependi... Asymptotic Analysis Asymptotic analysis is depending on the idea that as the problem size grows, the complexity can be defined as a simple proportionality to some known functio

Properties of red- black tree, Any Binary search tree has to contain follow... Any Binary search tree has to contain following properties to be called as a red- black tree. 1. Each node of a tree must be either red or black. 2. The root node is always b

Explain the method of overlapping and intersecting, Overlapping or Interse... Overlapping or Intersecting A polygon overlaps or intersects the current background if any of its sides cuts the edges of the viewport as depicted at the top right corner of th