Home / Courses / IIT JAM Physics / Practice / Combinational logic

Combinational logic

Electronics · 19 questions and templates for IIT JAM 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. 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.

  5. 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‾.

  6. 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).

  7. 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.

  8. 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.

  9. 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.

  10. 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).

  11. 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.

  12. 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.

  13. NATExam level

    Two signed numbers, +100 and +50, are added in an 8-bit two's-complement adder. Read as a signed number, the 8-bit result is ______.
    Answer and solution

    Answer: -106

    100+50=150=100101102. As an 8-bit signed value the leading 1 makes it negative: 150−256=−106. Overflow: two positives gave a negative (the carry into the sign bit differs from the carry out).

    Why people get this wrong: Answering 150: it does not fit in the range −128 to +127.

  14. MCQExam level

    The expression XY+X‾Z+YZ simplifies to
    1. XY+YZ
    2. X+Z
    3. Y+Z
    4. XY+X‾Z
    Answer and solution

    Answer: D

    This is the consensus theorem. Write YZ=YZ(X+X‾)=XYZ+X‾YZ. Then XY+XYZ=XY and X‾Z+X‾YZ=X‾Z, so the YZ term is redundant: F=XY+X‾Z. (Check: X=0,Y=1,Z=0 gives F=0, ruling out Y+Z.)

    Why people get this wrong: Dropping X‾Z instead loses minterms such as X=0,Y=0,Z=1.

  15. NATHard

    Using only 2-input NAND gates, the smallest number needed to make a 2-input XOR is ______.
    Answer and solution

    Answer: 4

    Let N=AB. Then AN=AAB and BN, and a final NAND gives ANBN=AN+BN=(A+B)AB=A⊕︎B. Four gates; sharing N is the trick (the straightforward version needs 5).

    Why people get this wrong: Building A‾ and B‾ separately costs extra gates.

← All topics · Timed mock test →