Test 3: Boolean Algebra

Week: 10
Coverage: Weeks 8-10
Duration: 90 minutes

Topics Covered

• Boolean functions and truth tables
• Normal forms (DNF, CNF)
• Logic gates and circuits
• Karnaugh maps
• Boolean simplification
• Functional completeness

Sample Problem Types

1. Truth tables: Construct table for given formula
2. Normal forms: Convert expression to DNF/CNF
3. Simplification: Simplify using Boolean laws
4. Circuits: Design circuit for given function
5. K-maps: Use K-map to minimize function
6. Completeness: Prove set is functionally complete

Key Skills

• Truth table construction
• Normal form conversions
• Expression simplification
• Circuit design
• K-map technique
• Understanding completeness

Preparation

• Review Lecture 5 notes
• Rework Homework 3 problems
• Practice K-maps (2-4 variables)
• Review Boolean laws