Mathematical Foundations for Computing

9.

Boolean Algebra and Logic Circuits

9.1.

Boolean Algebra

9.1.1.

Boolean Variables and Functions

9.1.2.

Basic Boolean Operations

9.1.3.

Boolean Expressions

9.1.4.

Truth Tables for Boolean Functions

9.2.

Boolean Identities

9.2.1.

Fundamental Identities

9.2.2.

De Morgan's Laws

9.2.3.

Distributive Laws

9.2.4.

Absorption Laws

9.3.

Simplification of Boolean Expressions

9.3.1.

Algebraic Simplification

9.3.2.

9.3.3.

Quine-McCluskey Method

9.4.

Logic Gates and Circuits

9.4.1.

Basic Logic Gates

9.4.2.

Combinational Circuits

9.4.3.

Sequential Circuits

9.4.4.

Circuit Design Principles

Previous

8. Graph Theory

Go to top

Next

10. Formal Languages and Automata Theory