When a consensus term is present in any expression, it can be ignored from the expression without
effecting the result.
1) xy + x'z + yz = xy + x'z, where yz is the consensus term
2.25. Assume that in a certain byte-addressed machine all instructions are 32 bits long. Assume
the following state of affairs for the machine:
Fill in the fo
2.4. Write the code to implement the expression A= (B-C) *D ON 3-,2-,1- and 0-address
machines. Do not rearrange the expression in accordance with programming language practice,
computing the expression should change the values of its operand
Q) A program contains the following instruction mix:
20% load/store instructions with execution time of 3 ns each
70% ALU instructions with execution time of 2.1 ns each
10% branch instructions with execution time of
1.1 The Intel 8086 processor addresses a maximum of 2^20 bytes of memory. What is the
maximum number of 16-bit words that can be stored in this memory?
8 bits=1 byte
16-bit word=2 bytes of memory
2^20 bytes of memory is equivalent to
1. In the section on performance estimation on page 168 it was arbitrarily assumed that The
minimum clock period of the 2-bus design would be 1.1 times the clock Period of the 1-bus
design. Given the delays in Exercise 4.1
4.2. Extend the SRC instruction set by adding the instruction swap ra, rb, (op=7), that exchange
the contents of the two specified registers.
a. Define a plausible abstract RTN for this instruction.
b. Develop the concrete RTN for it, assumin