Question: Repeat Problem 9-28 with A = 10100100 and B = 10101001. Problem 9-28 The program in a computer compares two signed 2s complement numbers A

Repeat Problem 9-28 with A = 10100100 and B = 10101001.

Problem 9-28

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 9-10 that will have a true condition.

Table 9-10

Conditional Branch Instructions for Signed Numbers Branch Condition Branch if greater Branch if greater or

Conditional Branch Instructions for Signed Numbers Branch Condition Branch if greater Branch if greater or equal Branch if less Branch if less or equal Branch if equal Branch if not equal Mnemonic BG BGE BL BLE BE BNE Condition A > B AZ B A

Step by Step Solution

3.32 Rating (155 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a A 1010 0100 9... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Logic And Computer Design Fundamentals Questions!