Google
 

BOOLEAN ALGEBRA  

  • 2.1. Generalities
  • 2.2. Fundamental Theorems of Boolean Algebra
  • 2.3. The Existence and the Oneness of the Boolean Functions
  • 2.4. Representing Logical Functions and Arithmetic Operations by Logical Gates
  •  
    • Binary Switches
    • Implementing Logical Functions

  • 2.5. Truth Tables and Canonical Forms of Boolean Functions
  • 2.6. Representation Forms of Boolean Functions
  • 2.6.1. Generalities
  • 2.6.2. The Main Properties of Boolean Functions
  • 2.6.3. Boolean Functions of Two Variables
  • 2.6.4. Elementary Forms and Terms for Boolean Functions
  •  
    • Elementary Forms
    • Logical Basic Operations
    • Symmetrical and Unsymmetrical Boolean Functions
    • Several Times Running
    • Sequential Functions

  • 2.7. Integrated Circuits
  •  
    • Definition of Integrated Circuits
    • Steps in Integrated Circuits Design
    • Integrating Arithmetic and Logic
    • Storing Data
    • Reducing Boolean Equations

Open Handouts for Boolean Algebra [pdf]

 

  Back to main content

Copyright © 2006-2008 Vasile Avram Valid CSS! Valid HTML 4.01 Transitional