boolean-minimization

Consider the following four variable Boolean function in sum-of-product form $$F\left(b_3, b_2, b_1, b_0\right)=\Sigma(0,2,4,8,10,11,12)$$ where the value of the function is comput...

Consider a Boolean function f(w, x, y, z) such that f(w, 0, 0, z) = 1 f(1, x, 1, z) = x + z f(w, 1, y, z) = wz + y The number of literals in the minimal sum-of-products expression...

Consider the following interm expression of $$F:$$ $$F\left( {P,\,Q,\,R,\,S} \right) = \sum {0,2,5,7,8,10,13,15} $$ The minterms $$2, 7, 8$$ and $$13$$ are 'do not care' terms. The...

What is the minimum number of gates required to implement the Boolean function $$(AB+C)$$ if we have to use only $$2$$-input NOR gates?

A circuit outputs a digit in the form of $$4$$ bits. $$0$$ is represented by $$0000$$, $$1$$ by $$0001..., $$ $$9$$ by $$1001.$$ A combinational circuit is to be designed which tak...

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...