The program in a computer compares two signed 2s complement numbers A and B by performing subtraction A - B and updating the status bits. For operands let A = 11011010 and B = 01110110,
(a) Evaluate the difference and interpret the binary result.
(b) Determine the value of status bits N (sign), Z (zero), and V (overflow).
(c) List the conditional branch instructions from Table that will have a true condition.
Table Conditional Branch Instructions for Signed Numbers
Branch Condition | Mnemonic | Condition | Status Bits* |
Branch if greater | BG | A > B | (N ⊕ V) + Z = 0 |
Branch if greater or equal | BGE | A ≥ B | N ⊕ V = 0 |
Branch if less | BL | A | N ⊕ V = 1 |
Branch if less or equal | BLE | A ≤ B | (N ⊕ V) + Z= 1 |
Branch if equal | BE | A = B | Z = 1 |
Branch if not equal | BNE | A ≠ B | Z = 0 |
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.