### Discussion :: Digital Electronics - Section 1 (Q.No.12)

- «« Digital Electronics - Section 1
- Digital Electronics - Section 2
- Digital Electronics - Section 3
- Digital Electronics - Section 4
- Digital Electronics - Section 5
- Digital Electronics - Section 6
- Digital Electronics - Section 7
- Digital Electronics - Section 8
- Digital Electronics - Section 9
- «« Digital Electronics - Section 10
- «« Digital Electronics - Section 11
- «« Digital Electronics - Section 12
- «« Digital Electronics - Section 13
- «« Digital Electronics - Section 14
- «« Digital Electronics - Section 15
- «« Digital Electronics - Section 16
- «« Digital Electronics - Section 17
- «« Digital Electronics - Section 18
- «« Digital Electronics - Section 19
- Digital Electronics - Section 20
- Digital Electronics - Section 21
- Digital Electronics - Section 22
- Digital Electronics - Section 23
- Digital Electronics - Section 24

12. | In the expression A + BC, the total number of minterms will be |
|||||||

Answer: Option D Explanation: The min terms are ABC + ABC + AB C + ABC + ABC. |

Tarun said: (Jun 25, 2014) | |

How you found these minterms? |

Selvi.M said: (Jul 22, 2014) | |

How to find minterms? |

Anup said: (Sep 12, 2014) | |

Minterm is a product of literals which each input variable appears exactly one. |

Kvrv said: (Nov 3, 2014) | |

A(B+B*)(C+C*) + BC(A+A*). |

Priya said: (Dec 25, 2014) | |

Can anyone explain how we obtain the above expression? |

Siva said: (Jan 13, 2015) | |

x+x* = 1. |

Kalpish said: (Jan 28, 2015) | |

Please explain briefly. |

Sharon said: (Mar 11, 2015) | |

In this we are using De Morgan's law. i.e A+BC = A(B+B')+BC(A+A'). = AB+AB'+ABC+A'BC. = AB(C+C')+AB'(C+C')+ABC+A'BC. = ABC+ABC'+AB'C+AB'C'+ABC+A'BC. = ABC+ABC'+AB'C+A'BC(ABC+ABC=ABC). = 1+1+1+1+1 = 5 min terms. So, the total no. of min terms are 5. |

Aneesh.M said: (Jan 13, 2016) | |

A+BC = A (B+B') (C+C') + BC (A+A'). = (AB+AB') (C+C') + ABC + A'BC. = ABC + ABC' + AB'C + AB'C' + ABC + A'BC. = ABC + ABC' + AB'C + A'BC' + A'BC. Since (ABC + ABC = ABC). Hence 5 minterms. |

Deepak Deshmukh said: (Jan 28, 2016) | |

Simply draw this equation on truth table. You will get the answer. |

Mayur said: (Jun 8, 2016) | |

Thank you @Sharon. |

Naresh said: (Aug 13, 2016) | |

Is it like A + BC = (A + B) (A + C). Then the number of min terms are 2, right? |

Seetha Kumari said: (Nov 4, 2016) | |

How to find the minterm? A + BC = A (B + B') (C + C') + BC (A + A'). = A (BC + BC '+ B'C + B'C') + BCA + BCA', = ABC + ABC'+ AB'C + AB'C' + BCA + BCA', = 2ABC + ABC' + AB'C + AB'C' + A'BC. |

Padmaja said: (Dec 27, 2016) | |

A B C BC A+BC 1 1 1 1 1 1 1 0 0 1 1 0 1 0 1 1 0 0 0 1 0 1 1 1 1 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 Write the expressions for true values i.e. for 1 values. First five are true values. ABC + ABC' + AB'C + AB'C' + A'BC. |

Mrunal said: (Jan 10, 2017) | |

How we can find max terms for the same question? |

Deepshikha said: (Jun 20, 2017) | |

Yes, @Padmaja. If we want to find max terms of the same function then in the above expression, we just have to write the expression for the false values (0). So we get three expressions that is A'B'C'+A'B'C+A'BC'. |

Tamil said: (Jul 19, 2017) | |

Thank you @Padmaja. Your explanation is very helpful. |

Asim said: (Jul 19, 2017) | |

Thanks for the discussion. |

Rj Phenomenal said: (Aug 23, 2017) | |

We have to express it in standard form. |

Diksha said: (Oct 5, 2017) | |

Using k- map, it will be easy to solve these kind of problems. |

Deepak said: (Oct 19, 2017) | |

Correct @Diksha. |

Abdullah Akhtar said: (Nov 6, 2017) | |

Your formula A + BC = (A + B) (A + C). Is write but we have to find minterms @RAMESH. |

Mohammed Umar said: (Dec 13, 2017) | |

How to find maxterm? |

Sandeep said: (Dec 26, 2017) | |

Is any formula to find the number of minterms? |

Pavan said: (Feb 22, 2018) | |

Stil,l I can't understand how to solve this problem? Please someone help me? |

Dhammapriya said: (Mar 19, 2018) | |

First of all, we need to convert a given logical expression into the standard form for minterms called canonical form. Ex. A+BC = A(B+B')(C+C') + BC(A+A'). Now solve this expression with the help of Boolean Laws you will arrive at A+BC = ABC + ABC' + AB'C + AB'C' + A'BC. |

Adil Tanveer said: (May 1, 2018) | |

If we obtain the minterm then how can we obtain max term? Please, anyone explain it. |

Aparna said: (Aug 1, 2018) | |

I can't understand in truth table form. So please explain it. |

Mohiyuva said: (Jan 29, 2020) | |

@Padmaja. Could you please explain how to give 0's & 1's for that expression? |

Cherish said: (Nov 29, 2020) | |

@Mohiyuva it's all about "and gate" & "or gate". Truth Table: A -- B -- C -- Output 0 -- 0 -- 0 -- F 0 -- 0 -- 1 -- F 0 -- 1 -- 0 -- F 0 -- 1 -- 1 -- T 1 -- 0 -- 0 -- T 1 -- 0 -- 1 -- T 1 -- 1 -- 0 -- T 1 -- 1 -- 1 -- T. 5 true. So 5 minterm. |

#### Post your comments here:

Name *:

Email : (optional)

» Your comments will be displayed only after manual approval.