Truth table-are quick and clean methods (to prevent confusion) of writing down all the possible out puts for various curcitis or individual gates as each type of gate has its own truth table.
And gate-Have two inputs and only gives a on current (a numerical vale of 1) when there are two on inputs otherwise the outputs will all be off (a numerical value of 0) they look like this:
Not gates-only take one input in and reverse the value,this is then the output here is the truth table and what they look like.
Xor gate- exclusive or gates work exactly like or gates, the only difference is if there are two on inputs the output will be 0.
Nand gates-work exactly like and gates but you reverse the and out put so its a counciled down version of a and gate followed by a not gate.
Nor gates- an or gate followed by a not gate simplified.
Boolean algebra- is the algebraic way of representing a truth table and is used to simplify large logic gate diagrams
No comments:
Post a Comment