1
GATE CSE 1999
MCQ (More than One Correct Answer)
+2
-0
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?
2
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
Consider the logic circuit shown in Figure below. The functions $${f_1},$$ $${f_2}$$ and $$f$$ (in canonical sum of products form in decimal notation) are:
$${f_1}\left( {w,\,x,\,y,\,z} \right) = \sum {8,9,10} $$
$${f_2}\left( {w,\,x,\,y,\,z} \right) = \sum {7,8,12,13,18,15} $$
$$f\left( {w,\,x,\,y,\,z} \right) = \sum {\left( {8,9} \right)} $$
The function $${f_3}$$ is
3
GATE CSE 1997
MCQ (Single Correct Answer)
+2
-0.6
Let $$f\left( {x,y,z} \right) = \overline x + \overline y x + xz$$ be a switching function. Which one of the following is valid?
4
GATE CSE 1990
MCQ (Single Correct Answer)
+2
-0.6
Two $$NAND$$ gates having open collector outputs are tied together as shown in fig. The logic function $$Y,$$ implemented by the circuit is.
Questions Asked from Boolean Algebra (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2024 Set 1 (1)
GATE CSE 2021 Set 2 (1)
GATE CSE 2021 Set 1 (1)
GATE CSE 2020 (1)
GATE CSE 2019 (1)
GATE CSE 2018 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2015 Set 1 (2)
GATE CSE 2015 Set 3 (2)
GATE CSE 2015 Set 2 (2)
GATE CSE 2014 Set 3 (1)
GATE CSE 2010 (1)
GATE CSE 2008 (1)
GATE CSE 2007 (1)
GATE CSE 2006 (1)
GATE CSE 2004 (1)
GATE CSE 2002 (3)
GATE CSE 2000 (1)
GATE CSE 1999 (1)
GATE CSE 1997 (2)
GATE CSE 1990 (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