CPSC 2310 Exam 2

logical shift

bitwise operation that shifts all the bits of its operand

binary addition

carries on a value of 2 rather than a value of 10

field extraction

extract binary field using bit mask

Z = 1

indicates that the result is zero.

V = 1

indicates that there was an overflow (there were not enough bits to accurately represent the value of the result) during arithmetic performed in signed format. If the carry-in and carry-out of the msb (the sign bit) are different, then V is set to 1.

N = 1

indicates the result is negative for arithmetic performed on values in signed format.

C = 1

indicates there was an overflow during the arithmetic performed on values in unsigned format. In the case of addition, if there is a carry-out from the msb, then C is set. In the case of subtraction, if there is no carry-out from the msb, then C is set.

field insertion

insert binary field

branching

instruction in a computer program that can cause a computer to begin executing a different sequence of instructions

ASCII Character

in an ASCII file, each alphabetic, numeric, or special character is represented with a 7-bit binary number. 128 possible characters defined

binary logic

A logic gate performs a logical operation on one or more logic inputs and produces a single logic output. The logic used in computer systems is called Boolean logic because there are only 2 possible values, TRUE or FALSE (represented in binary as 1 or 0)

unsigned binary number

are, by definition, positive numbers and thus do not require an arithmetic sign. An m-bit unsigned number represents all numbers in the range 0 to 2m − 1.

arithmetic shift

(Arithmetic shift preserve sign bit, whereas Logical shift can not preserve sign bit.)Arithmetic shift perform multiplication and division operation, whereas Logical shift perform only multiplication operation. Arithmetic shift is used for signed interpretation, whereas Logical shift is used for unsigned interpretation.

hexadecimal

A base-16 number system that uses sixteen distinct symbols 0-9 and A-F to represent numbers from 0 to 15

condition codes (NZVC)

Extra bits kept by the processor that summarize the results of an operation that affect the execution of later instructions

unaligned operand

Requires extra shifting network hardware and extra time to perform two memory accesses and the necessary insertion of bytes (two trips across the bus)

byte

a group of binary digits or bits (usually eight) operated on as a unit

two's complement

a method of representing negative numbers in the binary system

logic operations (and, or, not)

and[cc] bic[cc] eor[cc] orr[cc]

aligned operand

memory access is typically on word-by-word basis. There is only one trip across the bus. halfwords start on a halfword boundary = address divisible by 2. Words start on a word boundary = address divisible by 4. Double words start on a double word boundary = address divisible by 8

OR

outputs 1 if at least 1 input is 1 ORing a bit with 0 produces the original bit

AND

outputs 1 if both inputs are 1 ANDing a bit with one produces the original bit

XOR

outputs 1 if exactly 1 input is 1 XORing a bit with 1 flips the bit. XORing a bit with 0 produces the original bit

signed binary number

required to encode negative numbers in binary number systems

binary subtraction

way to subtract binary numbers and allow negative binary numbers