# Repeat Problem 9-28 with A = 10100100 and B = 10101001. Problem 9-28 The program in a

## 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 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**

Fantastic news! We've Found the answer you've been seeking!

## Step by Step Answer:

**Related Book For**

## Logic And Computer Design Fundamentals

**ISBN:** 9780133760637

5th Edition

**Authors:** M. Morris Mano, Charles Kime, Tom Martin