1
GATE CSE 2011
MCQ (Single Correct Answer)
+1
-0.3
The simplified $$SOP$$ (Sum of product) form of the Boolean expression
$$\left( {P + \overline Q + \overline R } \right).\left( {P + \overline Q + R} \right).\left( {P + Q + \overline R } \right)$$ is
$$\left( {P + \overline Q + \overline R } \right).\left( {P + \overline Q + R} \right).\left( {P + Q + \overline R } \right)$$ is
2
GATE CSE 2010
MCQ (Single Correct Answer)
+1
-0.3
The minters expansion of $$f\left( {P,Q,R} \right) = PQ + Q\overline R + P\overline R $$ is
3
GATE CSE 2009
MCQ (Single Correct Answer)
+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?
4
GATE CSE 2008
MCQ (Single Correct Answer)
+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
Then $${f_2}$$ is
Questions Asked from Boolean Algebra (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2019 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2014 Set 3 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2013 (1)
GATE CSE 2011 (2)
GATE CSE 2010 (1)
GATE CSE 2009 (1)
GATE CSE 2008 (1)
GATE CSE 2007 (1)
GATE CSE 2004 (1)
GATE CSE 1997 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages