Scribd
Upload
7 views

Introduction to Boolean Algebra

Boolean algebra involves mathematical operations on binary variables (1 and 0). Logic gates, such as NOT, AND, and OR, control the flow of electrical pulses representing these binary digits. These gates can be combined to create complex combinatorial circuits, and truth tables are used to represent their outputs based on different inputs.

Uploaded by

rockerandrew
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

Introduction to Boolean Algebra

Boolean algebra involves mathematical operations on binary variables (1 and 0). Logic gates, such as NOT, AND, and OR, control the flow of electrical pulses representing these binary digits. These gates can be combined to create complex combinatorial circuits, and truth tables are used to represent their outputs based on different inputs.

Uploaded by

rockerandrew
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Boolean Algebra

Boolean algebra is the study of mathematical operations on variables that


can have only two values: either 1 (truth) or 0 (false).

Logic Gates
Electronics use complex circuits and switching arrangements. Electronic
devices control the flow of electrical pulses which represent the binary
digits (bits) 0 and 1. The switches for electronic pulses are logic gates.

NOT Gate
A NOT gate reverses the electronic pulse. It has the symbol.

A NOT gate receives a pulse of 1 or 0. If it receives a 1, it outputs a 0. If


it receives a 0, it outputs a 1.

We can present this information in a truth table as shown overleaf.

NOT Gate Truth Table

A A’
1 0
0 1
AND Gate
An AND gate produces an output that is denoted by A.B. You can only get
an output of 1if A AND B are both 1.

This is an AND gate

1
AND GATE Truth Table

OR Gate
An OR gate produces an output that is denoted by A+B. This gate
produces an output of 1 if A or B are 1.

OR Gate Truth Table

AND, NOT and OR gates can be joined together to form combinatorial


circuits.

Example
Label the following logic gate A’ + B. Then, draw a truth table.

A
A’ + B
B

2
A A’ B A’ + B
1 0 1 1

1 0 0 0

0 1 1 1

0 1 0 1

Exercise
1. Write a Boolean expression for the following circuits. Then, create the
truth table.
(i)

(ii)

(iii)

(iv)

(v)

3
(vi)

(vii)

(vi)

You might also like