2

Boolean Algebra

LEARNING OBJECTIVES

After studying this chapter, you will know about:

  1. Switching algebra.
  2. Two-variable Boolean algebra.
  3. Boolean expressions.
  4. Logic circuits.
  5. Gate circuits.
  6. Representation of expressions in different forms.
  7. Functionally complete sets of logic operators.
  8. Properties of NAND, NOR and EXCLUSIVE OR gates.

In this chapter, switching algebra is introduced as the basic mathematical tool essential in the analysis and synthesis of switching circuits. Switching circuits are also called logic circuits, gate circuits, and digital circuits. Switching algebra is another name for a two-valued Boolean algebra. Hence the terms Boolean Expressions and Switching Expressions are used to mean the same thing.

2.1 FUNDAMENTAL ...

Get Switching Theory and Logic Design now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial