1. Given below is a C++ statement:
a = b - (c + d);
a) Assuming variables a, b, c and d have been declared already, write an IJVM code segment using minimum number of IJVM lines for the above statement.
b) Each IJVM instruction takes a number of microinstructions to execute. If one microinstruction takes 5 nsec, how much time (in nsec) would your IJVM code segment above take to execute?
6. Currently there are no IJVM instructions to multiply two numbers. You can however use existing instructions to multiply top two numbers on stack. Assume that two positive numbers are placed on the stack. Write IJVM code that will remove these top two words, multiply and
put their product back on the stack. You are allowed to use existing IJVM instructions only.
Include appropriate comments to explain your code.
7. The table below illustrates a superscalar CPU with in-order issue and in-order completion of instructions. Addition/Subtraction instructions take 2 cycles while Multiplication/Division instructions take 3 cycles. Up to 2 instructions can be decoded and issued in one cycle and no
instructions can be issued in a cycle in which instructions are retiring.