Boolean Algebra 2 – Simplifying Complex Expressions
Автор: Computer Science Lessons
Загружено: 2017-11-22
Просмотров: 199348
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.
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
