M2: Boolean Algebra#

ScheduledSep 16 - Oct 1  

This module introduces digital systems, including number systems, logic circuits, Verilog and CAD, and clocks.

Reading#

Required Textbook Reading:

• 2.3 (Truth Tables)
• 2.4 (Logic Gates & Networks)
• 2.5 (Boolean Algebra)
• 2.6.1 (Sum-of-Products and Product-of-Sums Forms)
• 2.11 (Minimization and Karnaugh Maps)
• 2.12 (Strategy for Minimization)
• 2.13 (Minimization of Product-of-Sums Forms)
• 2.14 (Incompletely Specified Functions)

Optional Supplemental Instruction:

• Boolean algebra (Wikipedia) – deep dive into the history and laws of Boolean algebra
• The Mathematics of Boolean Algebra (Stanford Encyclopedia of Philosophy) – philosophical look at Boolean algebra, a perspective you don’t always get in computing courses
• Boolean Algebra in 13 Minutes (TrevTutor on YouTube) – quick but helpful overview
• Neso Academy videos:
  • Sum of Products (SOP) Form - Part 1
  • Sum of Products (SOP) Form - Part 2
  • Product of Sums (POS) - Part 1
  • Product of Sums (POS) - Part 2
  • SOP and POS Form Examples
• Boolean Function Representation: SOP and POS Form | Minterms and Maxterms Explained – All About Electronics on YouTube
• Introduction to Karnaugh Maps – The Organic Chemistry Tutor on YouTube
• Karnaugh map – Wikipedia (for a deep dive)

Lecture Material#

• L5: Axioms
• L6: Equivalence
• L7: Theorems A
• L8: Theorems B
• L9: PoS and SoP
• L10: Minimization

Lab Work#

• Lab3: Combinational Circuits
• Lab4: Seven Segment Display

Assignments#

• Q4: Equivalence
• H3: Equivalence
• Q6: PoS and SoP
• Q5: Theorems
• H4: Boolean Algebra
• Q7: Minimization
• H5: Minimization