Assembly Language for x86 Processors (6th Edition) by Kip R. Irvine

6A3D 16 Chapter 1 • Basic Concepts Converting Signed Binary to Decimal Use the following algorithm to calculate the decimal equivalent of a signed binary integer: • If the highest bit is a 1, the number is stored in two’s-complement notation.

If S ϭ false, the function output (Z) is the same as X. If S ϭ true, the function output is the same as Y. 2 Section Review 1. Describe the following boolean expression: ¬X ∨ Y. 2. Describe the following boolean expression: (X ∧ Y). 3. What is the value of the boolean expression (T ∧ F) ∨ T ? 4. What is the value of the boolean expression ¬(F ∨ T) ? 5. What is the value of the boolean expression ¬F ∨ ¬T ? 6. Create a truth table to show all possible inputs and outputs for the boolean function described by ¬(A ∨ Β).

Download PDF sample

Rated 4.53 of 5 – based on 6 votes