Skip to page content
Boolean Algebra and Simplification
Computer Science · Chapter 2 · Section A: Boolean Algebra and Computer Hardware
Not started Not started
Your path through this chapter
Visual lesson Coming soon
Short slides, one idea at a time. We are preparing this chapter's lesson.
Notes Coming soon
Clear chapter notes for quick revision.
Flashcards Coming soon
Quick recall of key terms and facts.
Practice Coming soon
Board-style questions with instant checks.
Chapter test Free
Short and long chapter tests in board pattern, with results and analysis.
Step 5: Not started
Topics 6
- Binary valued quantities; postulates of Boolean algebra; AND, OR and NOT with truth tables
- Basic theorems: duality, idempotence, commutativity, associativity, distributivity, operations with 0 and 1, complements, absorption, involution
- De Morgan's theorem and its applications
- Sum of products and product of sums; minterms and maxterms; canonical and cardinal forms
- Reducing Boolean expressions algebraically
- Karnaugh maps for two, three and four variables (SOP and POS reduction)