Skip to content
Related Articles

Related Articles

UGC-NET | UGC-NET CS 2017 Dec 2 | Question 6

View Discussion
Improve Article
Save Article
  • Last Updated : 29 Sep, 2021

The Boolean function with the Karnaugh map
(A) (A+C).D+B
(B) (A+B).C+D
(C) (A+D).C+B
(D) (A+C).B+D

Answer: (A)

Explanation: To find the boolean function here we will use K-map
Select neighbouring Minterms as max as possible in powers of 2 ie 2 ,4,8 and so on.
Here we have selected group of minterms:
First we will take 8 minterms group which will give us B.
Now take 4 minterms group it will give us CD.
Another 4 minterms group will give us AD.
We have the expression B + CD + AD.
which can be reduced as B + D ( A + C )
So, option (A) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!