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

String manipulation, what is string manipulation? what is string manipulation?

Implement the physat algorithm, The first assignment in this course require... The first assignment in this course required you to acquire data to enable you to implement the PHYSAT algorithm (Alvain et al. 2005, Alvain et al. 2008) in this second assignment

Functions for inserting and deleting at either end of deque, Q. Devise a re... Q. Devise a representation for a given list where insertions and deletions can be made at both the ends. Such a structure is called Deque (which means Double ended queue). Write fu

Bubble sort, In this sorting algorithm, multiple swapping occurs in one pas... In this sorting algorithm, multiple swapping occurs in one pass. Smaller elements move or 'bubble' up to the top of the list, so the name given to the algorithm. In this method,

Explain multiplication method, Multiplication Method: The multiplication m... Multiplication Method: The multiplication method operates in 2 steps. In the 1ststep the key value K is multiplied by a constant A in the range O

Postfix expression, : Write an algorithm to evaluate a postfix expression. ... : Write an algorithm to evaluate a postfix expression. Execute your algorithm using the following postfix expression as your input: a b + c d +*f ­ .

Methods, what is folding method? what is folding method?

Program of implementation of stack using arrays, include int choice, st... include int choice, stack[10], top, element; void menu(); void push(); void pop(); void showelements(); void main() { choice=element=1; top=0; menu()

Stack, implement multiple stacks ina single dimensional array. write algori... implement multiple stacks ina single dimensional array. write algorithams for various stack operation for them.

The best average behaviour, The best average behaviour is shown by  Qui... The best average behaviour is shown by  Quick Sort