1) Jump and Jump and Link instructions have a six-bit op-code and a 26-bit jump address field. How is the full 32-bit Jump Address calculated? The jump address field is sign-extended six bits to the left. The leftmost four bits of the PC are concatenated with the jump address field, and two bits of zero are concatenated to the end of that. The leftmost six bits of the PC are concatenated with the jump address field. The jump address is ANDed with Register 0 to produce the jump address. -------------------------------------------------------------------------------- 2) How is a branch target address calculated? Sign-extend bits 15:0 of the instruction, append two bits of zeros, and add the result to the PC. Zero extend bits 15:0 of the instruction, append two bits of ones, and subtract the result from the PC. Add the immediate operand to register zero, and sign extend the result. Concatenate the leftmost 16 bits of the PC with the rightmost 16 bits of the instruction. -------------------------------------------------------------------------------- 3)How is the effective address calculated for lw and sw instructions? By converting the byte address to a word address and adding it to the PC. By putting the immediate operand into register 0. By sign-extending bits 15:0 of the instruction, and adding that to the contents of the register whose number is in bits 25:21 of the instruction. By using the shamt field of the instruction to determine where to branch.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

1) Jump and Jump and Link instructions have a six-bit op-code and a 26-bit jump address field. How is the full 32-bit Jump Address calculated?

  1. The jump address field is sign-extended six bits to the left.
  2. The leftmost four bits of the PC are concatenated with the jump address field, and two bits of zero are concatenated to the end of that.
  3. The leftmost six bits of the PC are concatenated with the jump address field.
  4. The jump address is ANDed with Register 0 to produce the jump address.

--------------------------------------------------------------------------------

2) How is a branch target address calculated?

  1. Sign-extend bits 15:0 of the instruction, append two bits of zeros, and add the result to the PC.
  2. Zero extend bits 15:0 of the instruction, append two bits of ones, and subtract the result from the PC.
  3. Add the immediate operand to register zero, and sign extend the result.
  4. Concatenate the leftmost 16 bits of the PC with the rightmost 16 bits of the instruction.

--------------------------------------------------------------------------------

3)How is the effective address calculated for lw and sw instructions?

  1. By converting the byte address to a word address and adding it to the PC.
  2. By putting the immediate operand into register 0.
  3. By sign-extending bits 15:0 of the instruction, and adding that to the contents of the register whose number is in bits 25:21 of the instruction.
  4. By using the shamt field of the instruction to determine where to branch.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Embedded software development
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education