Scribd
Upload
13 views

Boolean Algebra

Uploaded by

okatakyieba09
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
13 views

Boolean Algebra

Uploaded by

okatakyieba09
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 9

Mark Name

___/ Class
Boolean Algebra Date

1. What do we mean by the term Boolean Logic? [1]


A form of algebra formulated around the 3 Boolean operators: NOT;
AND and OR

2. Write out the terminology for Boolean symbols

English AQA OCR


OR A+B AvB
AND A.B A^B
NOT ‾‾ ¬A
XOR A⊕B A(v underscore)B

NAND . ‾‾ ¬^
NOR ‾‾ ¬v
XNOR Θ Θ

3. Write out the above laws in the OCR format

AND OR LAW
X^0=0 Xv1=1 Annulment Law
X^1=X Xv1=X Identity Law
X^X=X XvX=X Idempotent Law
X ^ ¬X = 0 X v ¬X = 1 Complement Law
¬¬X = X ¬¬X = X Double Negation
Law
X^Y=Y^X XvY=YvX Commutative Law
(X^Y)^Z = X^(Y^Z) (X^Y)^Z = X^(Y^Z)
Associative Law

X ^ (Y v Z) = XY v XZ X v YZ = (X v Y) ^ (X v
Z) Distributive Law

¬(X ^ Y) = ¬X v ¬Y ¬(X v Y) = ¬X ^ ¬Y
de Morgan's
Theorem

X ^ (X v Y) = X X v XY = X Absorption Law
Redundancy Law
Consensus Law
XOR Gate

XNOR Gate

4. What is the order of precedence for logic gates operations


(and, or, not) [3]

High Logic
precedence operations
1 NOT
2 AND
3 OR

1 Answer the following logic gate problems

a. 1 v 1 = 1 [1] b. 0 v 0 = 0 [1]

c. ¬1 = 0 [1] d. 1^0 = 0 [1]

e. 0^1 = 0 [1] f. 0^0 = 0 [1]

g. !1 ^ !1 = 0 h. !1 v 0 = 0
2 Simplify the following [8]

a. Xv1= 1 b. XvX= X

c. Yv0= 0 d. Y^1= Y

e. Y^1(XvY)= f. XvY(X^Y)=YvX(Y
Y(YvX) ^X)

h. ¬¬X = X
g. X = X

3 Simplify the following logic equations and state which laws


you have used

a. ¬A¬(AvB) v ¬(A^B) = Q

= ¬A¬A¬B v ¬A v ¬B
= ¬A¬B v ¬A v ¬B
= ¬A v ¬B

De Morgan’s law
Idempotent law
Absorption law

b. C(A v B) v A v B = Q
= CA + A + CB + B
= A(C +1) + B(C + 1)
=A+B

Distribution
Absorption

c. ( M v N ) ( M v `N ) v ¬M^N v N = Q

*assuming apostrophe is a typo*


=MM v MN v MN v NN v ¬MN + N
= MM v MN v MN + N
= MM + MN + N
= MM + N
=M+N

distribution
absorption

d. ¬X ^ ¬( X Y ) = Q

= ¬X¬X v ¬Y¬X
= ¬X + ¬Y¬X
= ¬X(1 + ¬Y)
= ¬X

4 Complete the Table. The NAND version of DeMorgan’s Law

Standard Version DeMorgan’s Version


NAND X = ¬(A^B) X = ¬A v ¬B
AND X=A^B

NOR X=¬(AvB)

OR X=AvB
5
a. Fill in the following truth table

Input a Input b NAND


output
0 0 0
0 1 1
1 0 1
1 1 0

b. What is the purpose of a truth table?


Enables you to determine every possible outcome of a Boolean
operation/s given a set of inputs [1]

c. Complete the following truth table

Input a Input b NOR output


0 0 1
0 1 0
1 0 0
1 1 0

d. Why are XOR operations used in cyber security.


They are equally likely to produce an output of 1 or 0 meaning
that for a given ciphertext, you can deduce the key or plaintext
of you have either 1 or the 2 [2]
6 In the space below, draw the following logic gates using only
NAND gates

OR

AND
NOT

XOR

You might also like