Question: Suppose we are compiling for a machine with 1-byte characters, 2-byte shorts, 4-byte integers, and 8-byte reals, and with alignment rules that require the address
Suppose we are compiling for a machine with 1-byte characters, 2-byte shorts, 4-byte integers, and 8-byte reals, and with alignment rules that require the address of every primitive data element to be an even multiple of the element’s size. Suppose further that the compiler is not permitted to reorder fields. How much space will be consumed by the following array? Explain.
A : array [0..9] of record
s : short
c : char
t : short
d : char
r : real
i : integer
Step by Step Solution
3.50 Rating (170 Votes )
There are 3 Steps involved in it
240 bytes Within each element of the array s has offset 0 c has offset 2 t has offse... View full answer
Get step-by-step solutions from verified subject matter experts
