Home / Courses / CSIR NET Physics / Practice / Combinational logic

Combinational logic

Electronics · 76 questions and templates for CSIR NET Physics, in order from warm-up to top rank. Check each answer, then read the full solution.

Loading questions… (they need JavaScript; nothing you type is sent anywhere)

Written questions with solutions

The same questions as a list, so you can print them or read without the practice box. Templates (fresh numbers) appear only in the practice box above.

  1. MCQWarm-up

    How many different Boolean functions of three variables are there?
    1. 8
    2. 64
    3. 256
    4. 512
    Answer and solution

    Answer: C

    Three variables give 23=8 rows in the truth table, and each row can be 0 or 1 independently: 28=256 functions. In general 22n.

    Why people get this wrong: 8 is the number of rows (minterms), not of functions.

  2. MCQWarm-up

    A binary decoder with 4 input lines (and an enable) has how many output lines?
    1. 16
    2. 8
    3. 4
    4. 32
    Answer and solution

    Answer: A

    An n-to-2n decoder activates exactly one output for each of the 2n input codes: 24=16 outputs, each one a minterm of the inputs.

    Why people get this wrong: An encoder goes the other way, from 2n lines to n.

  3. MCQWarm-up

    The value of A⊕︎A‾ is
    1. 0
    2. A
    3. A‾
    4. 1
    Answer and solution

    Answer: D

    A and A‾ always differ, and XOR is 1 exactly when its inputs differ. So A⊕︎A‾=1, while A⊕︎A=0.

    Why people get this wrong: Mixing it up with A⋅A‾=0.

  4. NATWarm-up

    A 16:1 multiplexer is built as a tree of 2:1 multiplexers only. The number of 2:1 multiplexers needed is ______.
    Answer and solution

    Answer: 15

    The first level pairs the 16 inputs with 8 multiplexers (select bit S0), then 4, then 2, then 1: 8+4+2+1=15=24−1.

    Why people get this wrong: Answering 4 (the number of select lines) or 8 (only the first level).

  5. MCQWarm-up

    A half adder adds bits A and B. Its sum and carry outputs are
    1. sum A+B, carry AB
    2. sum A⊕︎B, carry AB
    3. sum AB, carry A⊕︎B
    4. sum A⊙B, carry A+B
    Answer and solution

    Answer: B

    1+1=102: the sum bit is 1 only when exactly one input is 1 (XOR), and the carry is 1 only when both are (AND).

    Why people get this wrong: The OR A+B gets 1+1 wrong.

  6. MSQWarm-up

    Which of these sets of operations are functionally complete (can build any Boolean function)?
    1. {AND, NOT}
    2. {OR, NOT}
    3. {AND, OR}
    4. {XOR, AND, constant 1}
    Answer and solution

    Answer: A, B, D

    AND and NOT give OR through De Morgan, so {AND, NOT} is complete; likewise {OR, NOT}. With XOR and the constant 1, A⊕︎1=A‾, so NOT and AND are available. {AND, OR} alone can only make monotone functions: it can never produce a NOT.

    Why people get this wrong: AND and OR feel like "everything", but without inversion you cannot make A‾.

  7. MCQWarm-up

    The complement of F=A+B‾C is
    1. A‾+BC‾
    2. A‾B+C‾
    3. A‾(B+C‾)
    4. A(B‾+C)
    Answer and solution

    Answer: C

    By De Morgan, A+B‾C=A‾⋅B‾C=A‾(B+C‾). Every OR becomes AND and every literal is complemented, keeping the grouping: the product B‾C becomes the sum B+C‾.

    Why people get this wrong: A‾B+C‾ loses the brackets; the AND with A‾ must apply to the whole of B+C‾.

  8. NATStandard

    The function F(A,B,C,D)=∑m(0,2,8,10) is simplified to a minimal sum of products. The total number of literals in it is ______.
    Answer and solution

    Answer: 2

    The minterms 0000, 0010, 1000, 1010 are the four corners of the K-map. They share B=0 and D=0 while A and C take all values, so F=B‾D‾: two literals.

    Why people get this wrong: Missing that the corners are adjacent (the map wraps around in both directions).

  9. MCQStandard

    The function F(A,B,C)=∑m(1,3,5,7) simplifies to
    1. A
    2. C‾
    3. C
    4. AB+C
    Answer and solution

    Answer: C

    Minterms 1, 3, 5, 7 are exactly the odd numbers: the last bit C is 1 and A, B take all values. So F=C.

    Why people get this wrong: Reading the bit order backwards and answering A.

  10. NATStandard

    How many prime implicants does F(A,B,C)=∑m(0,1,2,5,6,7) have?
    Answer and solution

    Answer: 6

    On the 3-variable K-map the ones form a ring: each 1 has exactly two neighbouring 1s and no group of four exists. The pairs are A‾B‾ (0,1), B‾C (1,5), AC (5,7), AB (6,7), BC‾ (2,6), A‾C‾ (0,2): six prime implicants, none essential. Such a function is called cyclic.

    Why people get this wrong: Counting only the terms of one minimal cover (3).

  11. MCQStandard

    For the cyclic function F(A,B,C)=∑m(0,1,2,5,6,7), a minimal sum of products has how many product terms?
    1. 2
    2. 3
    3. 4
    4. 6
    Answer and solution

    Answer: B

    Six ones, and each prime implicant covers two, so at least 3 terms are needed; 3 suffice, for example B‾C+A‾C‾+AB (or the other alternate set A‾B‾+BC‾+AC). Two minimal answers exist, both with 3 terms and 6 literals.

    Why people get this wrong: Using all six prime implicants.

  12. MCQStandard

    The carry output of a full adder with inputs A, B and carry-in Ci can be written as
    1. A⊕︎B⊕︎Ci
    2. ABCi
    3. A+B+Ci
    4. AB+Ci(A⊕︎B)
    Answer and solution

    Answer: D

    A carry comes out when at least two inputs are 1: AB+BCi+ACi, the majority function. Grouping: either A and B both generate it (AB), or exactly one of them is 1 and propagates the incoming carry (Ci(A⊕︎B)). The two forms are equal.

    Why people get this wrong: A⊕︎B⊕︎Ci is the sum output.

  13. NATStandard

    A 4-bit ripple-carry adder uses full adders whose carry output settles 2 ns after its inputs and whose sum output settles 3 ns after its inputs. With all inputs applied at t=0, the most significant sum bit is guaranteed correct after ______ ns.
    Answer and solution

    Answer: 9 ns

    The carry ripples through the first three stages: 3×2=6 ns until the carry into the last stage is correct. That stage then needs 3 ns for its sum: 6+3=9 ns.

    Why people get this wrong: Counting four carry delays plus a sum delay (11 ns): the last stage's carry-out is not needed for its own sum.

  14. MCQStandard

    The 8-bit two's-complement number 1111 1011 represents
    1. 251
    2. −4
    3. −5
    4. −123
    Answer and solution

    Answer: C

    The sign bit is 1, so the value is negative. Invert and add 1: 00000100+1=00000101=5. The number is −5. (Unsigned it would be 251 =256−5.)

    Why people get this wrong: −123 reads it as sign-magnitude.

  15. MSQStandard

    Which identities hold for the exclusive-OR operation?
    1. (A⊕︎B)⊕︎C=A⊕︎(B⊕︎C)
    2. A⊕︎B⊕︎B=A
    3. A⊕︎1=A‾
    4. A⊕︎(BC)=(A⊕︎B)(A⊕︎C)
    Answer and solution

    Answer: A, B, C

    XOR is addition modulo 2: associative, B⊕︎B=0, and adding 1 flips a bit. The last identity fails for A=1, B=1, C=0: left side 1⊕︎0=1, right side 0⋅1=0. (AND does distribute over XOR: A(B⊕︎C)=AB⊕︎AC.)

    Why people get this wrong: Distributivity works one way only: AND over XOR, not XOR over AND.

  16. MCQStandard

    The 4-bit Gray code for the binary number 1011 is
    1. 1101
    2. 1110
    3. 0111
    4. 1011
    Answer and solution

    Answer: B

    Keep the first bit and XOR each pair of neighbouring bits: g3=1, g2=1⊕︎0=1, g1=0⊕︎1=1, g0=1⊕︎1=0. Gray code 1110. Successive Gray codes differ in one bit, which is why shaft encoders and K-map axes use it.

    Why people get this wrong: XORing with the wrong neighbour (shifting the other way).

  17. NATStandard

    The decimal numbers 47 and 38 are added in BCD with 4-bit binary adders. In how many of the two digit positions must the correction "add 0110" be applied?
    Answer and solution

    Answer: 1

    Units: 7+8=15=11112, more than 9, so add 0110: 10101, digit 5 with a carry. Tens: 4+3+1=8, valid, no correction. Result 85, with one correction.

    Why people get this wrong: Forgetting the carry into the tens digit, or correcting a valid digit.

  18. MCQStandard

    The hexadecimal number (3A.8)16 in decimal is
    1. 58.5
    2. 58.8
    3. 59.0
    4. 38.5
    Answer and solution

    Answer: A

    3×16+10×1+8×16−1=48+10+0.5=58.5. Digits after the point carry negative powers of the base, so the 8 is 8/16, not 8/10.

    Why people get this wrong: Reading the fractional digit as a decimal tenth gives 58.8.

  19. NATStandard

    As a function of the four variables A,B,C,D, the expression F=A+BC has ______ minterms.
    Answer and solution

    Answer: 10

    A alone is true for 23=8 of the 16 input combinations; BC for 22=4; both (ABC) for 2. By inclusion-exclusion, 8+4−2=10 minterms.

    Why people get this wrong: Adding 8+4=12 counts the two minterms with A=B=C=1 twice.

  20. NATExam level

    The minimal sum-of-products form of F(A,B,C,D)=∑m(0,2,5,7,8,10,13,15) contains ______ literals in total.
    Answer and solution

    Answer: 4

    Minterms 0, 2, 8, 10 are the four corners: B‾D‾. Minterms 5, 7, 13, 15 form the central square: BD. So F=B‾D‾+BD=B⊕︎D, 4 literals. A and C do not matter at all.

    Why people get this wrong: Grouping in pairs instead of quads gives 12 literals.

  21. MCQExam level

    A minimal sum-of-products form of F(A,B,C,D)=∑m(1,3,7,11,15)+d(0,2,5) is
    1. CD+A‾B‾
    2. CD+A‾B‾D
    3. A‾B‾C‾D+CD
    4. D
    Answer and solution

    Answer: A

    CD covers 3, 7, 11, 15 (an essential prime). Minterm 1 is left. Using the don't-cares 0 and 2, the quad A‾B‾ (0, 1, 2, 3) covers it with two literals. (A‾D, using don't-care 5, is an equally small alternative.) D alone would include 9 and 13, which must be 0.

    Why people get this wrong: Not using don't-cares to enlarge a group, or using a don't-care to include a real 0.

  22. MCQExam level

    The minimal sum of products of F(A,B,C,D)=∑m(2,3,7,9,11,13)+d(1,10,15) is
    1. CD+B‾C+AD
    2. CD+B‾D+AD
    3. B‾C+AD
    4. CD+B‾C+AC‾D
    Answer and solution

    Answer: A

    Prime implicants (with the don't-cares): CD (3, 7, 11, 15), B‾C (2, 3, 10, 11), AD (9, 11, 13, 15) and B‾D (1, 3, 9, 11). Minterm 7 is covered only by CD, 2 only by B‾C, and 13 only by AD: all three are essential and together cover everything. F=CD+B‾C+AD.

    Why people get this wrong: B‾D is a prime implicant but not needed; dropping CD leaves 7 uncovered.

  23. MCQExam level

    A 4:1 multiplexer has select lines A (most significant) and B; its data inputs are I0=C, I1=C‾, I2=0, I3=1. The function it realises is
    1. ∑m(1,2,6,7)
    2. ∑m(0,3,6,7)
    3. ∑m(1,2,4,5)
    4. ∑m(1,3,6,7)
    Answer and solution

    Answer: A

    F=A‾B‾C+A‾BC‾+AB‾⋅0+AB⋅1. In minterms of ABC: A‾B‾C=001=1; A‾BC‾=010=2; AB gives 110 and 111 = 6, 7. So ∑m(1,2,6,7).

    Why people get this wrong: Swapping C and C‾ on the first two inputs gives ∑m(0,3,6,7).

  24. MCQExam level

    A 3-to-8 decoder has its outputs 1, 2, 4 and 7 joined by an OR gate. The resulting function of the inputs A, B, C is
    1. AB+BC+CA
    2. A⊕︎B⊕︎C
    3. A⊕︎B⊕︎C
    4. A‾B‾C‾
    Answer and solution

    Answer: C

    Each decoder output is a minterm, so the OR gives ∑m(1,2,4,7): inputs 001, 010, 100, 111, exactly those with an odd number of ones. That is odd parity, A⊕︎B⊕︎C (the full-adder sum).

    Why people get this wrong: The majority function (carry) is ∑m(3,5,6,7).

  25. MSQExam level

    The circuit for F=AB+A‾C is built from AND gates and an OR gate, with an inverter making A‾. Which statements are correct?
    1. With B=C=1, a change of A can produce a brief 0 glitch at the output (a static-1 hazard)
    2. Adding the consensus term BC removes this hazard
    3. The glitch arises because A and A‾ reach the OR gate through paths of different delay
    4. Reducing the expression to fewer terms is the standard cure for hazards
    Answer and solution

    Answer: A, B, C

    With B=C=1, F=A+A‾=1 in theory. But when A falls, the AB term may drop before the A‾C term rises (the inverter adds delay): a momentary 0. The redundant consensus term BC stays 1 throughout and holds the output. Hazard-free design adds terms; it does not remove them.

    Why people get this wrong: A minimal expression is not necessarily glitch-free.

  26. NATExam level

    In a carry-lookahead adder adding A=1011 and B=0110, each bit has propagate Pi=Ai⊕︎Bi and generate Gi=AiBi. The number of bit positions with Pi=1 is ______.
    Answer and solution

    Answer: 3

    P=1011⊕︎0110=1101: three positions propagate. G=1011⋅0110=0010: bit 1 generates. Then C2=G1=1, C3=P2C2=1, C4=P3C3=1: the sum is 10001 (11 + 6 = 17).

    Why people get this wrong: Using OR for propagate is also allowed for carries, but then the count would be 4.

  27. NATExam level

    A CMOS chip has 106 gates, each switching an average load of 50 fF, with activity factor 0.1 (fraction of gates switching per cycle), at 1.0 V and 1 GHz. Its dynamic power is ______ W.
    Answer and solution

    Answer: 5 W (±0.01)

    Each switching event charges and discharges C through the transistors, costing CV2 per cycle. P=NαCV2f=106×0.1×50×10−15×1×109=5 W. Halving the voltage would quarter it.

    Why people get this wrong: Using 12CV2 (the energy stored) instead of CV2 (energy drawn from the supply per full cycle).

  28. MCQExam level

    A logic family has VOH(min)=2.4 V, VOL(max)=0.4 V, VIH(min)=2.0 V and VIL(max)=0.8 V. Its high and low noise margins are
    1. both 0.4 V
    2. high 0.4 V, low 0.8 V
    3. high 2.0 V, low 0.4 V
    4. both 1.2 V
    Answer and solution

    Answer: A

    NMH=VOH−VIH=2.4−2.0=0.4 V; NML=VIL−VOL=0.8−0.4=0.4 V. Noise smaller than this cannot turn a valid output into an invalid input.

    Why people get this wrong: Subtracting output from output or input from input.

  29. NATExam level

    A Boolean function is self-dual if it equals its dual: f(x‾1,…,x‾n)=f(x1,…,xn). The number of self-dual functions of 3 variables is ______.
    Answer and solution

    Answer: 16

    The 8 input rows pair up as x and its complement x‾ (4 pairs). Choosing f on one row of a pair fixes it on the other. So there are 24=16 self-dual functions, 22n−1 in general.

    Why people get this wrong: Answering 28=256 (all functions) or 8.

  30. MCQExam level

    A 4-to-2 priority encoder gives input D3 the highest priority. With D3D2D1D0=0110, its output Y1Y0 is
    1. 01
    2. 11
    3. 00
    4. 10
    Answer and solution

    Answer: D

    The highest-priority active input is D2 (since D3=0), so the output is the code of 2: Y1Y0=10. D1 is ignored. A valid-output flag distinguishes "D0 active" from "nothing active".

    Why people get this wrong: Encoding the lowest active input (01).

← All topics · Timed mock test →