Скачать или смотреть Online tutorial on reducing a Boolean expression using Boolean algebra and De Morgan's Theorem

To find out more about GBC's Electronics Technician Program, please visit this link - http://goo.gl/pW7iKH
The purpose of this video is to examine the steps involved in creating and reducing the Boolean expression using the laws of Boolean algebra and De Morgan's theorem. Boolean algebra is a logical calculus of truth values. As Boolean equations increase in size and complexity, it becomes necessary to simplify these statements to their most basic form. Boolean theorems are used to reduce the size and complexity of Boolean equations. There are eight single variable theorems and seven multi-variable theorems.

In this video a Boolean expression for the NOR gate array is reduced using the Boolean and De Morgan's theorem. The 15 Boolean theorems along with the 2 De Morgan's theorems mentioned in the video are widely used for reducing Boolean expressions.

Below are the Boolean algebra reduction steps:
1. To create the reduced Boolean expression for the array, begin at the inputs on the left and provide each gate's output logic moving through the array towards the output.
2. Express each output in its reduced format as you move through the array using Boolean and De Morgan theorems for simplification.

This video shows the step by step solution on how to use the Boolean and De Morgan's theorems to simplify the NOR gate array.

More circuit troubleshooting is performed using simulation tool such as circuit logix which is provided free with Electronics and Electromechanical technician programs offered by George Brown College. Check out the Electronics Technician Certificate as well as other related online certificate programs offered by George Brown College by visiting our website at http://www.gbctechtraining.com

For more related videos on topics relating to the PLC, Electronics, Electromechanical as well as Robotics certificate courses, subscribe to our YouTube Channel at    / techtrain.  .