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.
-
MCQWarm-up
How many different Boolean functions of three variables are there?- 8
- 64
- 256
- 512
Answer and solution
Answer: C
Three variables give rows in the truth table, and each row can be 0 or 1 independently: functions. In general .Why people get this wrong: 8 is the number of rows (minterms), not of functions.
-
MCQWarm-up
A binary decoder with 4 input lines (and an enable) has how many output lines?- 16
- 8
- 4
- 32
Answer and solution
Answer: A
An -to- decoder activates exactly one output for each of the input codes: outputs, each one a minterm of the inputs.Why people get this wrong: An encoder goes the other way, from lines to .
-
MCQWarm-up
The value of is- 0
- 1
Answer and solution
Answer: D
and always differ, and XOR is 1 exactly when its inputs differ. So , while .Why people get this wrong: Mixing it up with .
-
MCQWarm-up
A half adder adds bits and . Its sum and carry outputs are- sum , carry
- sum , carry
- sum , carry
- sum , carry
Answer and solution
Answer: B
: 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 gets wrong.
-
MCQWarm-up
The complement of isAnswer and solution
Answer: C
By De Morgan, . Every OR becomes AND and every literal is complemented, keeping the grouping: the product becomes the sum .Why people get this wrong: loses the brackets; the AND with must apply to the whole of .
-
NATStandard
The function 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 and while and take all values, so : two literals.Why people get this wrong: Missing that the corners are adjacent (the map wraps around in both directions).
-
MCQStandard
The function simplifies toAnswer and solution
Answer: C
Minterms 1, 3, 5, 7 are exactly the odd numbers: the last bit is 1 and , take all values. So .Why people get this wrong: Reading the bit order backwards and answering .
-
MCQStandard
The carry output of a full adder with inputs , and carry-in can be written asAnswer and solution
Answer: D
A carry comes out when at least two inputs are 1: , the majority function. Grouping: either and both generate it (), or exactly one of them is 1 and propagates the incoming carry (). The two forms are equal.Why people get this wrong: is the sum output.
-
MCQStandard
The 8-bit two's-complement number 1111 1011 represents- 251
Answer and solution
Answer: C
The sign bit is 1, so the value is negative. Invert and add 1: . The number is . (Unsigned it would be 251 .)Why people get this wrong: reads it as sign-magnitude.
-
MCQStandard
The 4-bit Gray code for the binary number 1011 is- 1101
- 1110
- 0111
- 1011
Answer and solution
Answer: B
Keep the first bit and XOR each pair of neighbouring bits: , , , . 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).
-
MCQStandard
The hexadecimal number in decimal isAnswer and solution
Answer: A
. Digits after the point carry negative powers of the base, so the is , not .Why people get this wrong: Reading the fractional digit as a decimal tenth gives .
-
NATStandard
As a function of the four variables , the expression has ______ minterms.Answer and solution
Answer: 10
alone is true for of the 16 input combinations; for ; both () for . By inclusion-exclusion, minterms.Why people get this wrong: Adding counts the two minterms with twice.
-
NATExam level
Two signed numbers, and , 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
. As an 8-bit signed value the leading 1 makes it negative: . 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 to .
-
MCQExam level
The expression simplifies toAnswer and solution
Answer: D
This is the consensus theorem. Write . Then and , so the term is redundant: . (Check: gives , ruling out .)Why people get this wrong: Dropping instead loses minterms such as .
-
NATHard
Using only 2-input NAND gates, the smallest number needed to make a 2-input XOR is ______.Answer and solution
Answer: 4
Let . Then and , and a final NAND gives . Four gates; sharing is the trick (the straightforward version needs 5).Why people get this wrong: Building and separately costs extra gates.