Tugas pengantar teknologi informasi

  Nama: Bravo Marvel Kelas: 2B NIM: 2103015233 Rangkuman Boolean dan Karnaugh Map Standard Forms of   Boolean Expressions Sum of Product (SOP) Form The sum-of-products (SOP) form is a method (or form) of simplifying the Boolean expressions of logic gates. In this SOP form of Boolean function representation, the variables are operated by AND (product) to form a product term and all these product terms are ORed (summed or added) together to get the final function. A sum-of-products form can be formed by adding (or summing) two or more product terms using a Boolean addition operation. Here the product terms are defined by using the AND operation and the sum term is defined by using OR operation. The sum-of-products form is also called as Disjunctive Normal Form as the product terms are ORed together and Disjunction operation is logical OR. Sum-of-products form is also called as Standard SOP. SOP form representation is most suitable to use them in FPGA (Field Programmable

  Nama: Bravo Marvel Kelas: 2B NIM: 2103015233   Rangkuman Teorema DeMorgan's Teorema DeMorgan’s( De Morgan’s  theorem) DeMorgan’s theorem may be thought of in terms of  breaking   a long bar symbol. When a long bar is broken, the operation directly underneath the break changes from addition to multiplication, or vice versa, and the broken bar pieces remain over the individual variables. When multiple “layers” of bars exist in an expression, you may only break one bar at a time, and it generally easier to begin simplificatiaon by breaking the longest (uppermost) bar first. You should never break more than one bar in a single step. As tempting as it may be to conserve steps and break more than one bar at a time, it often leads to an incorrect result, so don’t do it! It is possible to properly reduce this expression by breaking the short bar first, rather than the long bar first Review ·          DeMorgan’s Theorems describe the equivalence between gates with