Fichas
Karnaugh Maps | Boolean Algebra - OCR Computer Science A Level
Fichas del conjunto (5)
- 1What are Karnaugh Maps?> Provide an alternate way of simplifying boolean expressions
> Often easier than using boolean algebra when manipulating many variables
> Similar to truth tables
> Allows for easy grouping of common factors - 2How do you Group Expressions for use in a Karnaugh Map?Split at the OR (∨)
e.g., (A ∧ B) ∨ C = (A ∧ B) ¦ C - 3How do you Fill in a Karnaugh Map?> Mark where each variable would be 1 or 0 respectively, depending on the presence of ¬ (e.g., A = 1, ¬A = 0)
> Match up the respective variable with the box(es) on the Karnaugh Map
yes that's a bad explanation but oh well - 4What are the Rules for Simplifying Boolean Expressions in Karnaugh Maps?> Group factors in boxes / squares
> Boxes must contain 2ⁿ values
> Do not use diagonals
> Only 1s must be in the boxes
> Boxes must be as large as possible
> Boxes can overlap and wrap around - 5What are the Steps for Simplifying Boolean Expressions in Karnaugh Maps?> Take each box in any order
> Take each variable in any order
> If the digit for the variable in the heading stays the same, keep it
> Otherwise, discard the variable
> Write down the simplified expression with OR / ∨ in between
Información
- Descripción
- A level (Boolean Algebra) Computer Science Fichas sobre Karnaugh Maps | Boolean Algebra - OCR Computer Science A Level, creado por Malachy Moran-Tun el 02/12/2021.
- Creado por
- Malachy Moran-Tun
- Visitas
- 7
- Valoración