Questions No 01 Marks (12)
Write the code/instructions to implement the expression A = (B – C) + 15(D – 45) on 3, 2, 1, and 0-address machines.
Questions No 02 Marks (08)
Compute the total memory traffic in bytes for both instruction fetch and instruction execution for the code that implements the expression evaluation for the four machines in question # 1.
Assume opcodes occupy one byte, addresses occupy three bytes, and data values also occupy three bytes. Don’t mix it with code size of instruction.
Download Solution Here CS501ASSIGNMENT-01DOWNLOAD SOLUTION HERE