Sign in to save your progress, vote, and build your own decks.Sign in
Unit 1.4.3 Boolean Algebra
8 cards·by gurundus
What are the laws of boolean Algebra?
Commutative, Associate, Distributive, Identity, Negation, Redundancy, De Morgan's and
other Laws
What are the requirements that have to be fulfilled for Karnaugh maps?
The groups Cannot contain 0s, cannot be diagonal, must be as large as possible, must contain
1,2,4 or 8 in a block
What do you do to solve a Karnaugh Map when you have decided the groups?
If variables A is 0 and B is 0 for example and they do not change with in that box that means that
block is (¬A).(¬B)
What is the final step of solving a Akrnaugh maps?
Taking the sum of all the rules you have determined to be true, putting a plus between them, then
simplifying it using boolean algerbra
What are the two inputs of the D-type flip flop?
the control and the clock signal
What are the two outputs of the D-type flip flop?
the stored data and the inverse
When is a change of the stored data Q triggered?
when the clock switches to positive (leading edge).
What happens when Q changes?
the control input is stored in the flip flop until it is potentially changed next clock cycle