Embedded Files
a) Define problems using Boolean logic
b) Manipulate Boolean expressions, including the use of Karnaugh maps to simlify Boolean expressions.
c)Use of the following rules to derive or simplify statements in Boolean algebra: De Morgan's Laws, distribution, association, commutation, double negation.
d)Using logic gate diagrams and truth tables
e)The logic associated with D type flip flops, half and full adders
a) Define problems using Boolean logic
a) Define problems using Boolean logic
Videos
Videos
1.4.3a Define problems using Boolean logic.mp4b) Manipulate Boolean expressions, including the use of Karnaugh maps to simlify Boolean expressions.
b) Manipulate Boolean expressions, including the use of Karnaugh maps to simlify Boolean expressions.
Videos
Videos
1.4.3b Karnaugh maps part 1.mp41.4.3b Karnaugh maps part 2.mp4c)Use of the following rules to derive or simplify statements in Boolean algebra: De Morgan's Laws, distribution, association, commutation, double negation.
c)Use of the following rules to derive or simplify statements in Boolean algebra: De Morgan's Laws, distribution, association, commutation, double negation.
Videos
Videos
A level Simplifying Boolean algebra example.mp4A level Simplifying Boolean algebra.mp4d)Using logic gate diagrams and truth tables
d)Using logic gate diagrams and truth tables
Videos
Videos
1.4.3a George Boole.mp41.4.3c Logic gates and truth tables.mp4e)The logic associated with D type flip flops, half and full adders
e)The logic associated with D type flip flops, half and full adders
Videos
Videos
A level D type flip flops.mp4A level A level Half & Full adders.mp4Exam Q & As
Exam Q & As
1.4.3_Boolean_Algebra.pdfExtra Resources
Extra Resources
Report abuse