Week 5

Chapters (Computer organization and design fundamentals):

• 4 Logic Functions and Gates
  • 4.1 Logic Gate Basics
    • 4.1.1 NOT Gate
    • 4.1.2 AND Gate
    • 4.1.3 OR Gate
    • 4.1.4 Exclusive-OR (XOR) Gate
  • 4.2 Truth Tables
  • 4.3 Timing Diagrams for Gates
  • 4.4 Combinational Logic
  • 4.5 Truth Tables for Combinational Logic
• 5 Boolean Algebra
  • 5.1 Need for Boolean Expressions
  • 5.2 Symbols of Boolean Algebra
  • 5.3 Boolean Expressions of Combinational Logic
  • 5.4 Laws of Boolean Algebra
  • 5.5 Rules of Boolean Algebra
    • 5.5.1 NOT Rule
    • 5.5.2 OR Rules
    • 5.5.3 AND Rules
    • 5.5.4 XOR Rules
    • 5.5.5 Derivation of Other Rules
  • 5.6 Simplification
  • 5.7 DeMorgan's Theorem
• 6 Standard Boolean Expression Formats
  • 6.1 Sum-of-Products
  • 6.2 Converting an SOP Expression to a Truth Table
  • 6.3 Converting a Truth Table to an SOP Expression
  • 6.4 Product-of-Sums
  • 6.5 Converting POS to Truth Table
  • 6.6 Converting a Truth Table to a POS Expression
  • 6.7 NAND-NAND Logic
• 7 Karnaugh Maps
  • 7.1 The Karnaugh Map
  • 7.2 Using Karnaugh Maps
  • 7.3 "Don't Care" Conditions in a Karnaugh Map

Videos:

• Intro to Boolean Logic, Truth Tables, Buffer, NOT Gate
• AND Gate
• OR Gate
• EXCLUSIVE-OR Gate (XOR Gate)
• Introduction to Combinational Logic
• Deriving a Truth Table from Combinational Logic
• Boolean Expressions, Circuits, and Truth Tables
• Active Low Decoders, NAND Gate
• Introduction to Boolean Algebra
• Identities of Boolean Algebra
• Properties of Boolean Algebra
• De Morgan's Theorem and Other Properties
• Basic Boolean Algebraic Simplification Examples
• More Boolean Algebraic Simplification Examples
• Introduction to Sum of Products Expressions (SOP)
• Converting a SOP to a Truth Table
• Introduction to Product-of-Sums Expressions (POS)
• Converting a POS to a Truth Table
• Introduction to Karnaugh Maps
• Rules for Makin' Karnaugh Map Rectangles
• Karnaugh Maps and Don't Cares