Compute memory traffic, total memory for encoding and storing code that implements the expression evaluation for the following code. Assume that the opcode occupy one byte, address occupy two bytes, data values also two bytes and 1 byte word length. And also how the graphs for memory traffic, encoding memory, occupied memory Vs 0- 1-2-3 address machines and deduce interesting observations.
Answers
Explanation:
Instruction set size – It tells the total number of instructions defined in the processor.
Opcode size – It is the number of bits occupied by the opcode which is calculated by taking log of instruction set size.
Operand size – It is the number of bits occupied by the operand.
Instruction size – It is calculated as sum of bits occupied by opcode and operands.
Answer:
Write a programme that reads in a line of positive numbers one at a time, computes the product of such integers, and prints it. Up until the user submits an integer just under 1, integers are acknowledged and multiplied. This calculated total is not included in the final item. The output is then printed by the programme. If the first number submitted is a negative number or zero, the programme must print "bad input" and end right away. The programme then calculates and publishes the product's prime factorization, listing the components in ascending order. A prime number can be included in factorization if it is not a component of the product.
Explanation:
The amount of instructions specified in total for the CPU is indicated by the instruction set size.
Opcode size is determined by taking the log of the size of the instruction set, and it is the bits that the opcode occupies.
Operand size is the total amount of bits that the operand takes up.
The sum of the bits occupied by the opcode and operands is used to compute instruction size.
#SPJ3