1
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Consider the following Boolean expression for $$F:$$
$$F\left( {P,\,Q,\,R,\,S} \right) = PQ + \overline P QR + \overline P Q\overline R S.$$
The minimal sum-of-products form of $$F$$ is
$$F\left( {P,\,Q,\,R,\,S} \right) = PQ + \overline P QR + \overline P Q\overline R S.$$
The minimal sum-of-products form of $$F$$ is
2
GATE CSE 2013
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following expressions does NOT represent exclusive NOR of $$x$$ and $$y?$$
3
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
4
GATE CSE 2011
MCQ (Single Correct Answer)
+1
-0.3
Which one of the following circuits is NOT equivalent to a $$2$$-input $$XNOR$$ (exclusive NOR) gate
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 2 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 3 (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