Duration: 1.00 Hr
Course Level: Intermediate
Languages: English
Compatibility: Audio, Video
Boolean algebra, also known as Boolean logic, is a way of calculating truth values based on 0 and 1, or false and true. This system of logic, illustrated by Boolean logic gates, is applied to the construction, inputs, and outputs of applications such as circuitry and computer function. This course outlines the basics of Boolean functions and laws, instructions on writing out truth tables in order to illustrate each of the logic gates and all their possible outputs, instructions on converting these tables into Boolean expressions, how to use Boolean algebra to simplify combinational logic circuits, and how to convert Boolean expressions into Karnaugh maps.
Duration: 1.00 Hr
Course Level: Intermediate
Languages: English
Compatibility: Audio, Video
Boolean algebra, also known as Boolean logic, is a way of calculating truth values based on 0 and 1, or false and true. This system of logic, illustrated by Boolean logic gates, is applied to the construction, inputs, and outputs of applications such as circuitry and computer function. This course outlines the basics of Boolean functions and laws, instructions on writing out truth tables in order to illustrate each of the logic gates and all their possible outputs, instructions on converting these tables into Boolean expressions, how to use Boolean algebra to simplify combinational logic circuits, and how to convert Boolean expressions into Karnaugh maps.
Duration: 1.00 Hr
Course Level: Intermediate
Languages: English
Compatibility: Audio, Video
Boolean algebra, also known as Boolean logic, is a way of calculating truth values based on 0 and 1, or false and true. This system of logic, illustrated by Boolean logic gates, is applied to the construction, inputs, and outputs of applications such as circuitry and computer function. This course outlines the basics of Boolean functions and laws, instructions on writing out truth tables in order to illustrate each of the logic gates and all their possible outputs, instructions on converting these tables into Boolean expressions, how to use Boolean algebra to simplify combinational logic circuits, and how to convert Boolean expressions into Karnaugh maps.