Menu

**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.

- Describe the operation of the five basic gates.
- Identify the diagram symbol for the five basic gates.
- Identify Boolean algebra laws and rules for simplifying combinational logic circuits.

**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.

- Describe DeMorgan’s Theorems.
- Utilize Boolean algebra laws and rules for simplifying combinational logic circuits.
- Demonstrate the ability to convert a truth table into a Boolean expression.

**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.

- Discuss products-of-sums expressions.
- Discuss Karnaugh mapping and how it is performed.
- Demonstrate Boolean reduction using Karnaugh mapping.

- P.O. Box 26067

3163 Winston Churchill Blvd., Mississauga, Ontario, Canada L5L 5W7

info@globaltrainingsolutions.ca | www.globaltrainingsolutions.ca