This topic provides the tools for simplifying logic. You will apply the laws of Boolean algebra, including De Morgan's laws, to reduce an expression to a simpler equivalent, and use Karnaugh maps to do the same from a truth table. The second half covers useful circuits built from gates: the half adder and full adder used for binary arithmetic, and flip-flops including the SR and JK types, which store a single bit.
🔒 Sign in to view this topic's basics.