- Computer Science Engineering (CSE)
- Digital Electronics and Logic Design
- This is an example of a POS expression:

Q. |
## This is an example of a POS expression: |

A. | true |

B. | false |

C. | none of the above |

D. | can not predict |

Answer» A. true |

View all MCQs in:
Digital Electronics and Logic Design

- Write the expression for Boolean function F (A, B, C) = m (1,4,5,6,7) in standard POS form.
- Minimise the logic function (POS Form) F A,B,C,D) = PI M (1, 2, 3, 8, 9, 10, 11,14)× d (7, 15)
- The final output of a POS circuit is generated by .
- 3-to-8 decoder can be used to implement Standard SOP and POS Boolean expressions
- The expression is an example of Commutative Law for Multiplication.
- The simplification of the Boolean expression (A'BC')'+ (AB'C)' is
- The Boolean expression A.B+ A.B+ A.B is equivalent to
- Simplify the Boolean expression F = C(B + C)(A + B + C).
- Simplify the following expression into sum of products using Karnaugh map F(A,B,C,D) = (1,3,4,5,6,7,9,12,13)
- Simplify the given expression to its Sum of Products (SOP) form Y = (A + B)(A + (AB)')C + A'(B+C')+ A'B+ ABC

Login to Continue

It will take less than 2 minutes

Report MCQ