COMPUTER SCIENCE AND ENGINEERING
COMPUTER ARCHITECTURE
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Product-of-sums.
|
|
|
Sum-of-products
|
|
|
Karnaugh map
|
|
|
Matrix
|
Detailed explanation-1: -Sum of product(SOP) is a form of expression in boolean algebra where various product (AND) terms are combined together though sum (OR). Explanation: Suppose we have two variables A and B and one output function F defined on them. Output is true when any input is true.
Detailed explanation-2: -If the boolean expression is AB+BC. Then the product of sum expression is (A+B)(B+C). To find this, the complement of sum product expression is the product of sum expression. (AB+BC)’=A’B’+B’C’ By applying DEMORGANS LAW =(A’+B’)(B’+C’) Now, (A’+B’)’(B’+C’)’=(A+B)(B+C).
Detailed explanation-3: -2 What are two forms of Boolean expression? Ans. 2 Two canonical forms of any Boolean function are a “sum of minterms” and a “product of maxterms.” The terms Sum of Products or SOP and Product of sum or POS are widely used for the canonical representation of boolean expressions.
Detailed explanation-4: -Sum-of-Product form is a Boolean Algebra expression in which different “product” terms from inputs are “summed” together. Boolean Algebra is the digital logic mathematics we use to analyse gates and switching circuits such as those for the AND, OR and NOT gate functions, also known as a “Full Set” in switching theory.