This preview shows page 1. Sign up to view the full content.
Unformatted text preview: how it will be stored into memory in both a little-endian and big-endian system. Q4. (40pts) Write the code to implement the expression A = (B – D) * C + E on 3-, 2-, 1-, and 0-address machines. Do not rearrange the expression. In accordance with programming language practice, computing the expression should not change the value of its operands. Q5. (15pts) Suppose that a 4M x 16 main memory is built using 128K x 8 RAM chips and memory is word-addressable. a. How many RAM chips are necessary? b. How many RAM chips are there per memory word? c. How many address bits are needed for each RAM chip? d. How many address bits are needed for all of memory?...
View Full Document
- Spring '11