Explanations about the scope of the contents covered in the course, as well as by the topics of each of its chapters.

** **

Quine McCluskey Algorithm for Multiple Simultaneous Outputs Functions

Example using Quine McCluskey Algorithm

** **

NAND and NOT Circuits

Logic Gates

Sheffer Boolean Algebra

Definitions of Sheffer Boolean Algebra

Verification of Postulates for NAND and NOR Operations

Proof of not associativity of operations “Stroke” and “Dagger”

Synthesis of Circuits using Operations “Stroke” and “Dagger”

** **

Function Decomposition

Simple Disjunctive Decomposition

Propositions

Shannon expansion theorem

Application of Propositions in Sequence

Partition Tables

Final Considerations

** **

Iterative Network

Iterative Network – 1 dimension

Iterative Network – 2 dimensions

Typical use of Iterative Networks

Cells Generation Process

** **

Transients and Hazards in Switching Circuits

Types of Hazards

Circuits that present Static Hazards

Detecting Static Hazards

Preventing Static Hazards using Karnaugh Maps

Preventing Static Hazards using Quine McCluskey Algorithm

Disjunctive Forms Theorem

Conjunctive Forms Theorem

** **

Ferrite Rings

Two Levels Comparator – Schmitt Trigger

One Level Comparator

Problems to be solved

** **