Главная
Study mode:
on
1
Intro
2
OPERATIONS WITH O AND 1
3
IDEMPOTENT RULES
4
INVOLUTION
5
ASSOCIATIVE RULES
6
DISTRIBUTIVE
7
CONSENSUS
8
DEMORGAN
9
SIMPLIFICATION (A+B) B-A.B
10
SIMPLIFYING CIRCUITS
11
GENERAL NOTES
12
ABSORPTION A+A.BA
13
PROOF BY PERFECT INDUCTION (A+B) B-A.B
14
SECTION SUMMARY
Description:
Explore Boolean algebra and digital circuits in this 44-minute lecture from ECED2200. Learn about operations with 0 and 1, idempotent rules, involution, associative rules, distributive properties, consensus, and DeMorgan's laws. Dive into circuit simplification techniques, including absorption and proof by perfect induction. Gain valuable insights into digital logic design and optimization, despite minor visual issues due to screen resolution changes during recording.

Digital Circuits Boolean Algebra

Colin O'Flynn
Add to list