Chapter 5: Boolean Algebra

Content locked

The catalog is public. Reading this content requires approved access.

5.1 An introduction to Boolean algebra

Example 5.1.1: Shannon and switching circuits.

PARTICIPATION ACTIVITY

Animation content:

Animation captions:

PARTICIPATION ACTIVITY

CHALLENGE ACTIVITY

5.1.1: Evaluating Boolean expressions.

Start

PARTICIPATION ACTIVITY

Animation content:

Animation captions:

PARTICIPATION ACTIVITY

Terminology 5.1.1: A word about the words Boolean Algebra.

Additional exercises

EXERCISE

5.2 Boolean functions

Animation content:

Animation captions:

PARTICIPATION ACTIVITY

CHALLENGE ACTIVITY

5.2.1: Write in sum-of-minterms form.

Additional exercises

EXERCISE

5.3 Disjunctive and conjunctive normal form

PARTICIPATION ACTIVITY

Additional exercises

EXERCISE

5.4 Functional completeness

PARTICIPATION ACTIVITY

Animation content:

Animation captions:

PARTICIPATION ACTIVITY

EXERCISE

5.5 Boolean satisfiability

PARTICIPATION ACTIVITY

Animation content:

Animation captions:

Boolean satisfiability: DNF and CNF expressions

PARTICIPATION ACTIVITY

Animation content:

Animation captions:

PARTICIPATION ACTIVITY

Using SAT to express a scheduling problem

PARTICIPATION ACTIVITY

Variable assignments representing valid schedules

PARTICIPATION ACTIVITY

Constructing a Boolean expression to model the scheduling problem

Classes:

Constraints:

Animation content:

Animation captions:

PARTICIPATION ACTIVITY

Additional exercises

EXERCISE

5.6 Gates and circuits

Input variables

Output of circuit

Animation content:

Animation captions:

PARTICIPATION ACTIVITY

Describing a function using a circuit

Animation content:

Animation captions:

PARTICIPATION ACTIVITY

Animation content:

Animation captions:

PARTICIPATION ACTIVITY

Animation content:

Animation captions:

Designing circuits

PARTICIPATION ACTIVITY

Reset

PARTICIPATION ACTIVITY

Reset

CHALLENGE ACTIVITY

Start

Additional exercises

EXERCISE

Source