Logical Operations Flashcards
Absolute Error
the difference between the actual number and the nearest representable value
Absolute Value
also known as the magnitude, can be found by taking a negative binary number and switching all the 0s to 1s and all the 1s to 0s
And
a conjunction. Only when both statements are true is the combined compound statement true
Arithmetic Shift Function
multiplications of bit patterns, which involves moving the bits in a specified direction, either left or right, by a specified number of places
Boolean
can be true or false, can be shortened to bool
Absorptive Law
allows a reduction in complicated expression to a simpler one by absorbing terms
A+(A.B)=A
A(A+B)=A
Annulment Law
a law that states and always equals 1/or always equals 0. A variable and 0 is always equal to 0
A.0=0
A+1=1
Associative Law
this is a biconditional equivalence as long as they all use conjunction and disjunction i.e. not a continuation
A+(B+C)=(A+B)+C=A+B+C
A(B.C)
Commutative Law
the order for conjunctions or disjunctions does not matter
A.B=B.A
A+B=B+A
Complement Law
a term and’d with its complement equals 0/ a term or’d with its complement equals 1
A.NotA=0
A+NotA=1.
Distributive Law
a non-associate law i.e. the order of brackets matter, however the contents of the brackets are commutative -you can multiply out an expression
A(B+C)=A.B+A.C
A+(B.C)=(A+B).(A+C)
Double Complement Law
the double complement of a variable is always equal to the variable
Idempotent Law
an input that is and’d or or’d with itself is equal to the input
A+A=A
A.A=A
Identity Law
a law that states if a term is or’d with a 1 it will always be a 1/ if a term is and’d with a 0 it will always be a 0
De Morgan’s Law
the law that gives the relation between and, or, negation and complements in set theory
Buffer Overflow
where a data structure is not large enough for certain values of data to be passed into it causing data to spill out of the field and into nearby memory, overwriting program instructions
Buffer Underflow
where the data structure is not large enough for the values to be passed into it
Cyclic Shift
where, during a shift, the least significant bit is moved to a free space at the start of the string, causing no data to be lost, often used in modular arithmetic
Excessive Overflow
when a value overflows the data structure
Implication
the relationship between two statements
Most Significant Bit
the bit right at the beginning of the binary number, that has the most effect, because it shows whether a number is positive or negative
Negation
a unary argument i.e it is not
Normalisation
converting from fixed point to floating point
Operand
the number that the instruction is being done to
