Nov2017 cs Q6
0. The Boolean function with the Karnaugh map
is:
- Option : A
- Explanation : To find the boolean function here we will use K-map Select neighboring 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.
