Simplifying Boolean Expressions | Boolean Algebra - OCR Computer Science A Level

Description

A level Computer Science (Boolean Algebra) Flashcards on Simplifying Boolean Expressions | Boolean Algebra - OCR Computer Science A Level, created by Malachy Moran-Tun on 02/12/2021.
Malachy Moran-Tun
Flashcards by Malachy Moran-Tun, updated more than 1 year ago
Malachy Moran-Tun
Created by Malachy Moran-Tun over 2 years ago
5
0

Resource summary

Question Answer
What's the Benefit of Simplifying Boolean Expressions? > Uses less components > More reliable > Faster > Generates less heat > Cheaper
*sigh*... What are the General Rules of Boolean Algebra? (8 of them) 1. X ∧ 0 = 0 2. X ∧ 1 = 1 3. X ∧ X = X 4. X ∧ ¬X = 0 5. X ∨ 0 = X 6. X ∨ 1 = 1 7. X ∨ X = X 8. X ∨ ¬1 = 1
What are the Commutative Rules of Boolean Algebra? (yes they are REALLY obvious) 1. X ∧ Y = Y ∧ X 2. X ∨ Y = Y ∨ X
What are the Associative Rules of Boolean Algebra? 1. X ∧ (Y ∧ Z) = (X ∧ Y) ∧ Z 2. X ∨ (Y ∨ Z) = (X ∨ Y) ∨ Z
What are the Distributive Rules of Boolean Algebra? (yes they're really damn long) 1. (X ∧ Y) ∨ (X ∧ Z) = X ∧ (Y ∨ Z) 2. oh god... (X ∨ Y) ∧ (W ∨ Z) = (X ∧ W) ∨ (X ∧ Z) ∨ (Y ∧ W) ∨ (Y ∧ Z) :(
What are the Absorption Rules of Boolean Algebra? 1. X ∨ (X ∧ Y) = X 2. X ∧ (X ∨ Y) = X
What is the Extremely Obvious, Hopefully Logically Oblivious, Extraordinarily Clear Double Negation Rule of Boolean Algebra? 1. X = ¬¬X
What are de Morgan's Laws of Boolean Algebra? 1. ¬(A ∧ B) = ¬A ∨ ¬B 2. ¬(A ∨ B) = ¬A ∧ ¬B
Show full summary Hide full summary

Similar

Computing Hardware - CPU and Memory
ollietablet123
SFDC App Builder 2
Parker Webb-Mitchell
Data Types
Jacob Sedore
Intake7 BIM L1
Stanley Chia
Software Processes
Nurul Aiman Abdu
Design Patterns
Erica Solum
CCNA Answers – CCNA Exam
Abdul Demir
Abstraction
Shannon Anderson-Rush
Spyware
Sam2
HTTPS explained with Carrier Pigeons
Shannon Anderson-Rush
Data Analytics
anelvr