Logical Operations

Question 1

Absolute Error

Answer 1

the difference between the actual number and the nearest representable value

Question 2

Absolute Value

Answer 2

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

Question 3

And

Answer 3

a conjunction. Only when both statements are true is the combined compound statement true

Question 4

Arithmetic Shift Function

Answer 4

multiplications of bit patterns, which involves moving the bits in a specified direction, either left or right, by a specified number of places

Question 5

Boolean

Answer 5

can be true or false, can be shortened to bool

Question 6

Absorptive Law

Answer 6

allows a reduction in complicated expression to a simpler one by absorbing terms

A+(A.B)=A
A(A+B)=A

Question 7

Annulment Law

Answer 7

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

Question 8

Associative Law

Answer 8

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)

Question 9

Commutative Law

Answer 9

the order for conjunctions or disjunctions does not matter

A.B=B.A
A+B=B+A

Question 10

Complement Law

Answer 10

a term and’d with its complement equals 0/ a term or’d with its complement equals 1

A.NotA=0
A+NotA=1.

Question 11

Distributive Law

Answer 11

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)

Question 12

Double Complement Law

Answer 12

the double complement of a variable is always equal to the variable

Question 13

Idempotent Law

Answer 13

an input that is and’d or or’d with itself is equal to the input

A+A=A
A.A=A

Question 14

Identity Law

Answer 14

a law that states if a term is or’d with a 0 it will always be a 0/ if a term is and’d with a 1 it will always be a 1

Question 15

De Morgan’s Law

Answer 15

the law that gives the relation between and, or, negation and complements in set theory

Question 16

Buffer Overflow

Answer 16

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

Question 17

Buffer Underflow

Answer 17

where the data structure is not large enough for the values to be passed into it

Question 18

Cyclic Shift

Answer 18

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

Question 19

Excessive Overflow

Answer 19

when a value overflows the data structure

Question 20

Implication

Answer 20

the relationship between two statements

Question 21

Most Significant Bit

Answer 21

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

Question 22

Negation

Answer 22

a unary argument i.e it is not

Question 23

Normalisation

Answer 23

converting from fixed point to floating point

Question 24

Operand

Answer 24

the number that the instruction is being done to

Question 25

Operation

Answer 25

an action that is carried out to achieve a task

Question 26

Arithmetic Operation

Answer 26

allow numerical operations to be performed on values, e.g. integer division

Question 27

Boolean Operation

Answer 27

a form of algebra where all values are either True or False

Question 28

Logic Operation

Answer 28

a special symbol or word that connects two or more phrases of information

Question 29

String Operation

Answer 29

an operation that involves manipulating strings, e.g. concatenation

Question 30

Operator

Answer 30

the instruction that is being carried out

Question 31

Or

Answer 31

a disjunction. If one or more statement is true, the combined compound statement is true

Question 32

Order of Precedence

Answer 32

BODMAS for Boolean algebra: brackets, not, xor, and, or

Question 33

Overflow

Answer 33

occurs when a number resulting from a calculation is too small to be represented

Question 34

Precision

Answer 34

maximum number of significant digits that can be represented

Question 35

Propositional Logic

Answer 35

a statement that will either end in true or false, considering the way statements interact with each other and following mathematical rules

Question 36

Propositional Logic Symbols

Answer 36

uses symbols to represent logic links

Question 37

Radix Complement

Answer 37

methods of manipulating binary numbers, e.g. two’s complement

Question 38

Relative Error

Answer 38

absolute error divided by the actual number

Question 40

Truth Table

Answer 40

a diagram that shows all possible logical inputs and their associated outputs

Question 41

Two’s Complement

Answer 41

the law that states that the most significant bit should show whether a number is positive or negative, with 1 as negative and 0 as positive

Question 42

Underflow

Answer 42

occurs when a number resulting from a calculation is too small to be represented