Concept drill
dont-care
GATE CSE & IT · Boolean Algebra · 1991-2018
2
PYQs
0%
keyed
0
elite explanations
2
years appeared
Study anchor
Rosen — Discrete Mathematics and Its Applications
Discrete structures, counting, relations, graph theory
Practice action
Start latest PYQPYQs in this concept
All concepts →2018 PYQ
Consider the minterm list form of a Boolean function 𝐹 given below. $$F\left( {P,Q,R,S} \right) = $$ $$\sum {m\left( {0,2,5,7,9,11} \right)} $$ $$ + \,\,d\left( {3,8,10,12,14} \ri...
mediumbasic explanation
1991 PYQ
Find the minimum sum of products form of the logic function $$f\left( {A,B,C,D} \right) = \sum d \left( {3,11,12,14} \right)$$ Where $$m$$ and $$d$$ denote the minterms and don't c...
medium