1
GATE CSE 2002
Subjective
+2
-0
Transform the following logic circuit (without expressing its switching function) into an equivalent logic circuit that employs only $$6$$ $$NAND$$ gates each with $$2$$-inputs. 2
GATE CSE 2002
+2
-0.6
$$f\left( {A,B} \right) = A' + B$$ Simplified expression for function $$f((x+y,y),z)$$ is
A
$$(x'+z)$$
B
$$x\,y\,z$$
C
$$xy' + \,z$$
D
None of the above
3
GATE CSE 2000
+2
-0.6
The simultaneous equations on the Boolean variables $$x, y, z$$ and $$w,$$ $$x+y+z=1$$$$$xy=0$$$ $$xz+w=1$$$$$xy + \overline z \overline w = 0$$$
have the following for $$x, y, z$$ and $$w,$$ respectively.
A
$$0100$$
B
$$1101$$
C
$$1011$$
D
$$1000$$
4
GATE CSE 1999
MCQ (More than One Correct Answer)
+2
-0.6
Which of the following sets of component(s) is/are sufficient to implement any arbitrary Boolean function?
A
$$XOR$$ gates, $$NOT$$ gates
B
$$2$$ to $$1$$ multiplexers
C
$$AND$$ gates, $$XOR$$ gates
D
Three-input gates that output $$(A.B) + C$$ for the inputs $$A. B$$ and $$C.$$
GATE CSE Subjects
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Digital Logic
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude
EXAM MAP
Joint Entrance Examination