Boolean Algebra 2 – Simplifying Complex Expressions
This video follows on from the one about the laws of Boolean algebra. It explains some useful interpretations of the laws of Boolean algebra, in particular, variations of the annulment and distributive laws. It goes on to demonstrate how Boolean algebra can be applied to simplify complex Boolean expressions, and therefore how to simplify the combinational logic circuits that they represent. This video works through a number of examples of simplifying Boolean expressions, step by step, including algebraic proof of the absorptive law, and some examples you can try yourself. The next video in this series revisits some of the techniques covered here, and describes how De Morgan’s theorem can be applied to simplify complex Boolean expressions.
Boolean Algebra 3 – De Morgan’s Theorem
Karnaugh Maps – Introduction
Boolean Algebra 1 – The Laws of Boolean Algebra
Ep 035: More Boolean Algebraic Simplification Examples
Logic Gates, Truth Tables, Boolean Algebra AND, OR, NOT, NAND & NOR
Karnaugh Maps – Simplify Boolean Expressions
The PROBLEM with Capitalism - Smarter Every Day 316
Drawing Logic Gates From Boolean Expressions | Important Questions 4 | Digital Electronics
Example Problems Boolean Expression Simplification
Digital Logic - implementing a logic circuit from a Boolean expression.
Getting the Logic Expression and Truth Table from a Circuit
How Small Can a Video Game Actually Be?
The Oldest Unsolved Problem in Math
Binary 2 - Two's Complement Representation of Negative Numbers
Logic Gates and the Ripple Carry Adder
The Psychology Of People Who Are Too Conscious
TypeScript in Express – TypeScript Tutorial
