1
GATE CSE 2009
+1
-0.3
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
$$2$$
B
$$3$$
C
$$4$$
D
$$5$$
2
GATE CSE 2008
+1
-0.3
Given $${f_1},$$ $${f_3},$$ and $$f$$ in canonical sum of products form (in decimal) for the circuit. $${f_1} = \sum {m\left( {4,5,6,7,8} \right)}$$$$${f_3} = \sum {m\left( {1,6,15} \right)}$$$ $$f = \sum {m\left( {1,6,8,15} \right)}$$\$
Then $${f_2}$$ is
A
$$\sum {m\left( {4,6} \right)}$$
B
$$\sum {m\left( {4,8} \right)}$$
C
$$\sum {m\left( {6,8} \right)}$$
D
$$\sum {m\left( {4,6,8} \right)}$$
3
GATE CSE 2007
+1
-0.3
Consider the following Boolean function with four variables
$$F\left( {w,\,x,\,y,\,z} \right) = \sum {\left( {1,\,3,\,4,\,6,\,9,\,11,\,12,\,14} \right)}$$ the function is
A
Independent of one variables
B
Independent of two variables
C
Independent of three variables
D
Depends on all variables
4
GATE CSE 2004
+1
-0.3
The Boolean function $$x'y' +xy +x'y$$ is equivalent to
A
$$x'+y'$$
B
$$x+y$$
C
$$x+y'$$
D
$$x'+y$$
GATE CSE Subjects
EXAM MAP
Medical
NEET