Fichas
Simplifying Boolean Expressions | Boolean Algebra - OCR Computer Science A Level
Fichas del conjunto (8)
- 1What's the Benefit of Simplifying Boolean Expressions?> Uses less components
> More reliable
> Faster
> Generates less heat
> Cheaper - 2*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 - 3What are the Commutative Rules of Boolean Algebra? (yes they are REALLY obvious)1. X ∧ Y = Y ∧ X
2. X ∨ Y = Y ∨ X - 4What are the Associative Rules of Boolean Algebra?1. X ∧ (Y ∧ Z) = (X ∧ Y) ∧ Z
2. X ∨ (Y ∨ Z) = (X ∨ Y) ∨ Z - 5What 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) :( - 6What are the Absorption Rules of Boolean Algebra?1. X ∨ (X ∧ Y) = X
2. X ∧ (X ∨ Y) = X - 7What is the Extremely Obvious, Hopefully Logically Oblivious, Extraordinarily Clear Double Negation Rule of Boolean Algebra?1. X = ¬¬X
- 8What are de Morgan's Laws of Boolean Algebra?1. ¬(A ∧ B) = ¬A ∨ ¬B
2. ¬(A ∨ B) = ¬A ∧ ¬B
Información
- Descripción
- A level (Boolean Algebra) Computer Science Fichas sobre Simplifying Boolean Expressions | Boolean Algebra - OCR Computer Science A Level, creado por Malachy Moran-Tun el 02/12/2021.
- Creado por
- Malachy Moran-Tun
- Visitas
- 12
- Valoración