Skip to content

GATE EC Combinatorial Circuits questions

Practise Combinatorial Circuits questions for GATE EC. Explore official PYQs and original topic-wise quizzes, check answers and view available solutions. Free, no sign-in.

Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.

20 on this page
Official PYQ2004Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
A Boolean function ff of two variables xx and yy is defined as follows: f(0,0)=f(0,1)=f(1,1)=1;f(1,0)=0f(0,0)=f(0,1)=f(1,1)=1 ; \quad f(1,0)=0 Assuming complements of xx and yy are not available, a minimum cost solution for realizing ff using only 22-input NOR gates and 22-input OR gates (each having unit cost) would have a total cost of
Official PYQ2003Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
The number of distinct Boolean expressions of 44 variables is
Official PYQ2003Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
The output of the 7474 series of TTL\text{TTL} gates is taken from a BJT\text{BJT} in
Official PYQ2003Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
Without any additional circuitry, an 8:1  MUX8: 1 \; \mathrm{MUX} can be used to obtain
Official PYQ2003Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
The circuit shown in the figure has 44 boxes each described by inputs P,Q,RP, Q, R and outputs Y,ZY, Z with Y=P⊕Q⊕RZ=RQ+PˉR+QPˉ\begin{array}{l} Y=P \oplus Q \oplus R \\ Z=R Q+\bar{P} R+Q \bar{P} \end{array} The circuit acts as a
Official PYQ2003Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
If the functions W,X,YW, X, Y and ZZ are as follows W=R+PˉQ+RˉSX=PQRˉSˉ+PˉQˉRˉSˉ+PQˉRˉSˉY=RS+PR+PQˉ+Pˉ⋅Qˉ‾Z=R+S+PQ+Pˉ.Qˉ.Rˉ+PQˉ.Sˉ‾\begin{array}{l} W=R+\bar{P} Q+\bar{R} S \\ X=P Q \bar{R} \bar{S}+\bar{P} \bar{Q} \bar{R} \bar{S}+P \bar{Q} \bar{R} \bar{S} \\ Y=R S+\overline{P R+P \bar{Q}+\bar{P} \cdot \bar{Q}} \\ Z=R+S+\overline{P Q+ \bar{P} . \bar{Q} . \bar{R} + P \bar{Q} . \bar{S}} \end{array} Then
Official PYQ2003Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
The DTL, TTL, ECL and CMOS families of digital ICs\mathrm{IC}_{\mathrm{s}} are compared in the following 44 columns …
Official PYQ2003Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
The circuit shown in the figure converts
Official PYQ2002Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
If the input to the digital circuit the figure, consisting of a cascade of 20  XOR20 \; \mathrm{XOR}-gates is X\mathrm{X}, then the output YY is equal to
Official PYQ2002Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
If the input X3,X2,X1,X0X_{3}, X_{2}, X_{1}, X_{0} to the ROM in the figure are 8−4−2−18-4-2-1 BCD numbers, then the outputs Y3Y2Y1Y0Y_{3} Y_{2} Y_{1} Y_{0} are
Official PYQ2001Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
In the TTL circuit in the figure, S2\mathrm{S}_{2} to S0\mathrm{S}_{0} are select lines and X7\text{X}_{7} to X0\text{X}_{0} are input lines. S0\text{S}_{0} and X0\text{X}_{0} are LSBs. The output YY is
Official PYQ2000Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
For the logic circuit shown in the figure is the required input condition (A,B,C)(A, B, C) to make the output (X)=1(X)=1 is
Official PYQ2000Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
For the logic circuit shown in, the simplified Boolean expression for the output YY is
Official PYQ1999Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
Commercially available ECL\text{ECL} gears use two ground lines and one negative supply in order to
Official PYQ1999Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
The logical expresion y=A+A‾By=\mathrm{A}+\overline{\mathrm{A}} \mathrm{B} is equivalent to
Official PYQ1999Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
For a binary half-subtractor having two inputs A\text{A} and B\text{B}, the correct set of logical expressions for the outputs D\text{D} ( = A\text{A} minus B\text{B} ) and X(=\text{X}(= borrow) are
Official PYQ1999Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
The minimized form of the logical expression (AˉBˉCˉ+AˉBCˉ+AˉBC+ABCˉ)(\bar{A} \bar{B} \bar{C}+\bar{A} B \bar{C}+\bar{A} B C+A B \bar{C}) is
Official PYQ1998Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
The KK-map for a Boolean function is shown in the figure is The number of essential prime implicants for this function is
Official PYQ1998Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
For the identity AB+A‾C+BC=AB+A‾C\mathrm{AB}+\overline{\mathrm{A}} C+\mathrm{BC}=\mathrm{AB}+\overline{\mathrm{A}} \mathrm{C}, the dual form is
Official PYQ1998Digital CircuitsCombinatorial CircuitsMCQ · 1 mark
Two 2′2^{\prime} 's complement number having sign bits xx and yy are added and the sign bit of the result is zz. Then, the occurrence of overflow is indicated by the Boolean function