Problem 1 (20 points). Arrange the following branch/jump instructions in the des

Question

Problem 1 (20 points). Arrange the following branch/jump instructions in the descending order of their maximum possible jump target. That is, the instruction that allows the farthest possible jump must go first, followed by the next farthest, and so on. If two instructions allow the same amount of jump, list them in any order. Also state encoding format (R/I/J) and the number of bits used to represent the target address for each instruction. Finally, list for each instruction the maximum distance that can be jumped, both forwards and backwards in memory.

j, beq, jr, jal, bne

Explanation / Answer

Ans.
Descending order of maximum possible jump target:
beq,bne, jr,j,jal

j 000 010 26 bits (j type)
bne 000 101 5 bits (r type)
beq 000 100 5 bits (r type)
jr 000 000 5 bits (j type)
jal 000 011 26 bits (j type)

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.