Logic Gates
GATE Electronics & Communication · Digital Electronics - Logic Gates · 1988-2026
Study anchor
Source-book anchor pending for this concept.
Practice action
Start latest PYQPYQs in this concept
All concepts →In the circuit shown in the Figure, A and B are logic inputs and Y is the logic output. Which of the following logic operations is realized by the circuit?
A full adder and an XOR gate are used to design a digital circuit with inputs X, Y, and Z, and output F, as shown below. The input Z is connected to the carry-in input of the full...
In the circuit shown, what are the values of F for EN = 0 and EN = 1, respectively?
A 3-input majority gate is defined by the logic function M (a,b,c) = ab+bc+ca. Which one of the following gates is represented by the function M$$\left( {\overline {M\left( {a,b,c}...
If X and Y are inputs and the Difference (D = X – Y) and the Borrow (B) are the outputs, which one of the following diagrams implements a half-subtractor?
A bulb in a staircase has two switches, one switch being at the ground floor and the other one at the first floor. The bulb can be turned ON and also can be turned OFF by any one o...
What are the minimum number of 2-to 1 multiplexers required to generate a 2-input AND gate and a 2-input EX-OR gate?
The Boolean function Y=AB+CD is to be realized using only 2-input NAND gates. The minimum number of gates required is
A Boolean function 'f' of two variables x and y is defined as follows: f(0,0)=f(0,1)=f(1,1)=1;f(1,0)=0 Assuming complements of x and y are not available, a minimum cost solution fo...
A 0 to 6 counter consist of 3 flip-flops and a combination circuit of 2 input gate(s). The combination circuit consists of
A 2-bit binary multiplier can be implemented using
The minimum number of NAND gates required to implement the Boolean function $$A + A\overline B $$ $$ + A\overline B C$$ is equal to
Boolean expression for the output of XNOR (equivalence) logic gate with inputs A and B is
Indicate which of the following logic gates can be used to realize all possible combinational Logic functions:
The minimum number of 2-input NAND gates required to implement the Boolean function Z=A$$\overline {B\,} $$C, assuming that A, B and C are available, is