Scribd
Upload
1 views

Logic Gates and Boolean Algebra A Level Computer Science

The document discusses logic gates, focusing on D-type flip flops, binary addition, half adders, and full adders, explaining their functions and how they are constructed. It also covers the importance of simplifying circuit designs using Boolean algebra laws such as commutation, association, double negation, distribution, and De Morgan's laws. Overall, it provides foundational knowledge on digital circuits and binary arithmetic.

Uploaded by

dbeasley
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
1 views

Logic Gates and Boolean Algebra A Level Computer Science

The document discusses logic gates, focusing on D-type flip flops, binary addition, half adders, and full adders, explaining their functions and how they are constructed. It also covers the importance of simplifying circuit designs using Boolean algebra laws such as commutation, association, double negation, distribution, and De Morgan's laws. Overall, it provides foundational knowledge on digital circuits and binary arithmetic.

Uploaded by

dbeasley
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

LOGIC GATES

AND
BOOLEAN
ALGEBRA
Class Discussion

Share – what do you currently know


about logic gates?
D-Type Flip Flops
A flip flop is a type of logic circuit that can act as memory,
which can temporarily store the value of one bit.

A flip flop has just two inputs: a data input,


a clock input.

A clock pulse rises and falls as shown in the diagram, with


edges labelled rising or falling.
The output of a D-type flip flop can only change at a rising
edge, the start of a clock tick.

A flip flop is a basic unit of memory


Binary Addition
What are the rules of Binary addition?
Binary Addition Calculation Carry Sum
0+0+0 0 0
If we create a truth table for 0+0+1 0 1
binary addition, we can see how
the Sum and the Carry columns 0+1+1 1 0
are logically represented 1+1+1 1 1

X Y C S
0 0 0 0
0 1 0 1
1 0 0 1
1 1 1 0

What gate represents column C for Carry?


What gate represents column S for Sum?
Half Adder
A Half Adder circuit is able to add 2 bits
together to give the Sum and Carry output
bits
Binary Addition Calculation Carry Sum
0+0+0 0 0
If we create a truth table for 0+0+1 0 1
binary addition, we can see how
the Sum and the Carry columns 0+1+1 1 0
are logically represented 1+1+1 1 1

X Y Z C S
0 0 0 0 0
0 0 1 0 1
0 1 0 0 1
0 1 1 1 0
1 0 0 0 1
1 0 1 1 0
1 1 0 1 0
1 1 1 1 1
What gate/s represent column S for Sum
now?
What about the Carry?
Full Adder
A Full Adder circuit is able to perform binary
addition on 3 bits and calculate the output
Sum Bit and the Carry Bit.
We can create it by putting 2 half adders
together and combine them using an OR gate
to calculate the Carry bit
SIMPLIFYING
CIRCUITS

Why would it be beneficial to simplify


circuit designs as much as possible?

Sample Footer Text


• Laws(commute
Commutation for simplifying
from one side to the
Boolean Algebra
other),
• Association (associates are on the same level),
• Double negation (its not not hard to
remember).
• Distribution (multiply out the brackets),
• De Morgan’s Laws (3 steps),
• COMMUTATION (COMMUTE
FROM ONE SIDE TO THE
OTHER),

AVB=BVA

A^B=B^A
• ASSOCIATION (ASSOCIATES
ARE ON THE SAME LEVEL),

A ^ (B ^ C) = (A ^ B ) ^ C = A ^ B ^ C

A v (B v C) = (A v B ) v C = A v B v C
• DOUBLE NEGATION (ITS NOT
NOT HARD TO REMEMBER).

NOT (NOT A) = A

NOT NOT( NOT A OR NOT B) = NOT A OR NOT B

NOT (NOT A OR NOT B) = NOT (NOT A OR NOT B)


• DISTRIBUTION
(MULTIPLY OUT THE
BRACKETS),
A ^ (B v C) = (A ^ B) v (A ^ C)

A v (B ^ C) = (A v B) ^ (A v C)

And more obviously..


A v (B v C) = (A v B) v (A v C)
A ^ (B ^ C) = (A ^ B) ^ (A ^ C)
• DE MORGAN’S LAWS (3
STEPS)
In any order do the following 3 steps:
Not the whole thing

Not each side

Change the sign

i) NOT A OR B
ii) NOT (NOT A AND NOT B)
iii) NOT (A AND B)
iv) NOT A AND NOT B
v) NOT (NOT A OR NOT B)

You might also like