The memory unit of a computer has 2M words of 32 bits each. The computer has an instruction format with 4 fields: an opcode field; a mode field to specify 1 of 4 addressing modes; a register address field to specify one of 9 registers; and a memory address field. Assume an instruction is 32 bits long. Answer the following:   d) How large is the opcode field?

Assume that A and B are arrays with elements of the arrays as 4-byte integers and registers ($56) and $57 contain the base address of A) and 6, respectively. Assume A(1) - 100 +1 for i 0,1... 10 (1.e., A(0)-100, A(1)-101,...); and B(1)-1 for 1-8, 1,..., 10 (i.e. B(e)-8, B(1)-1, ...). Let registers Sso, Ss1, $52, 553 have the initial values of 0, 0, 2, 2, respectively. Loop: sll $t0, $s0, 2 Exit: After completing the loop, the values of A and B are A(0) - add $t0,$t0, $56 lw $t3, 0($10) add $14.$13,3 sw $t4,0($t0) sll $t1,$s1, 2 add $t1,$t1,$s7 lw $t5, 0($11) add $13,$t3,$t5 sw $t3,0($t1) addi $50, $s0. 1 addi Ss1, Ss1, 1 addi $s3, $s3.-1 bne $s3, $0. LOOP B(0) ,A(1)- B(1)- A(2)- B(2)- .A(3)- , B(3)-

A program consists of 100,000 instructions as follows: Type of Instruction, IC, and CPI Instruction Type Integer arithmetic Data transfer Control transfer Floating-point arithmetic 12,000 Processor Instruction Count Cycles per Instruction M1 - 500 MHz 48,000 M2 850 MHz 32,000 8,000 Determine the program execution time, the effective CPI for the machine, and the MIPS rate for the following processors. (each box is 2 points except CPI) 3 to 5 decimal places) 6 to 5 decimal places) 11 4 Execution Time Type of instruction, IC, and CPI CPI seconds (round seconds (round to 2 decimal places) (round with round up) with round up) MIPS rate (Whole number only (Whole number only

4. A portion of a computer program consists of a sequence of calculations where the results are stored in variables, like this (with inputs a, b and outputs d, g, h): Step Calculation 1 C = a + b d = a * C e = c + 3 4 f = C e g = a + f 6 h = f + 1 A computer can perform such calculations most quickly if the value of each variable is stored in a register, a chunk of very fast memory inside the microprocessor. Compilers face the problem of assigning each variable in a program to a register. Computers usually have few registers, however, so they must be used wisely and reused often. This is called the register allocation problem. In the example above, variables a and b must be assigned different registers, because they hold distinct input values. Furthermore, c and d must be assigned different registers; if they used the same one, then the value of c would be overwritten in the second step and wed get the wrong answer in the third step. On the other hand, variables b and d may use the…

Computer architecture

Assume a CPU with a fixed 32-bit instruction length has the following instruction format:opcode mode [operand1] [operand2] [operand3]The mode encodes the number of operands and each operand’s mode. For instance, one mode indicates three registers, another indicates two registers and an immediate datum, another indicates a main memory reference, etc. Assume there are 94 instructions and 22 modes. Answer the following.a. One mode indicates three registers. How many registers can be referenced in this mode?b. One mode indicates two registers and an immediate datum in two’s complement. Assuming there are 32 registers, what is the largest immediate datum that can be referenced?c. One mode has a destination register and a source memory address (an unsignednumber). Assuming 16 registers, what is the largest memory reference available?d. One mode has two memory addresses, both using base displacement. In both, the basesare stored in index registers and the displacements are specified in the…

Computer Architecture Consider a computer that has a number of registers such that the three registers R0 = 1500R1 = 4500R2 = 1000 Show the effective address of memory and the registers’ contents in each of the following instructions (assume that all numbers are decimal). 1. ADD (R0)+, R2 2. SUBTRACT - (R1), R2 3. MOVE 500(R0), R2 4. LOAD #5000, R2 5. STORE R0, 100(R2)

Part 2: Status Flags There are more registers inside of the CPU that we don't have direct access to. One of these is the EFLAGS register. This register holds the values of the flags used in the CPU's operation. Flags are just single bit values that represent the state of the processor - usually 1 means a setting is on or true, and 0 means it is off or false.  If a flag has the value 1, we say the flag is set. If it has the value 0, we say it is clear. "Setting" a flag means setting it's value to 1, and "clearing" a flag means setting its value to 0.  The status flags are flags that show the outcomes of certain operations. These can be used to check the state of the computations and react accordingly. For example, the carry flag is set if the result of an unsigned addition is too large to fit into the same space as the numbers used during the addition. Look at the following addition operation: 11111111 + 00000001 = 100000000 Note that the result of the addition is 9 bits long, even…

Suppose a program’s 15-th logical instruction (counting starts from zeroth) is at physical address 1234ABDE16 in the RAM. (contents of any logical address fits into any physical address) What is the physical address in the RAM where the program has been loaded?  What is the physical address in the RAM of the last instruction of the program if it has 37 logical instructions altogether?

The memory unit of a computer has 256K words of 32 bits each. The computer has an instruction format with four fields: an operation code field, a mode field to specify one of seven addressing modes, a register address field to specify one of 60 processor registers, and a memory address. Specify the instruction format and the number of bits in each field of the instruction if the instruction is in one memory word.