Logic gates and Boolean algebra
Electronics · 13 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.
-
MCQWarm-up
The smallest number of bits that can represent every whole number from to in plain binary isAnswer and solution
Answer: B
bits cover to . is too small; . So bits ().Why people get this wrong: Choosing 8 because data usually comes in whole bytes: 7 bits already reach 127.
-
NATStandard
A memory chip stores KB, organised as one byte per address ( KB bytes). The number of address lines it needs is ______.Answer and solution
Answer: 12
KB addresses, and address lines select locations. So lines. The data lines carry the byte itself and are not part of the count.Why people get this wrong: Counting bits (, giving 15) instead of addressable words.
-
MCQStandard
In excess-3 code, the decimal digit is written asAnswer and solution
Answer: D
Excess-3 adds to each decimal digit and writes the result in 4-bit binary: . The code is self-complementing: the 9's complement of a digit is obtained by inverting its bits (, ).Why people get this wrong: is plain BCD; subtracts 3 instead of adding.
-
NATExam level
A synchronous counter uses flip-flops with clock-to-output delay ns and setup time ns; the logic that forms each flip-flop's next input adds at most ns. The highest clock frequency at which it works reliably is ______ MHz.Answer and solution
Answer: 50 MHz
In one clock period the outputs must change ( ns), ripple through the next-state logic ( ns) and be stable at the next flip-flop inputs for the setup time ( ns). ns, so MHz. Unlike a ripple counter, this does not grow with the number of bits (as long as the logic delay does not).Why people get this wrong: Leaving out the setup time ( MHz) or multiplying by the number of flip-flops as in a ripple counter.
-
MSQExam level
Which statements are correct?- A shift register is a sequential circuit.
- A multiplexer needs a clock to choose which input to pass.
- A latch is level-sensitive, while an edge-triggered flip-flop responds only at a clock edge.
- A ROM used as a look-up table is a combinational circuit: its output depends only on the present address.
Answer and solution
Answer: A, C, D
A circuit is sequential if its output depends on past inputs (it has memory). A ROM read is a fixed function of the address: combinational. A shift register stores bits in flip-flops: sequential. A multiplexer is pure gating, with select lines and no clock. A latch is transparent while its enable is active; a flip-flop samples only at an edge.Why people get this wrong: A ROM "stores" data, but reading it involves no state that changes with time, so it counts as combinational.
-
MCQExam level
A 16-bit ripple-carry adder is built from full adders, each taking ns from carry-in to carry-out. The worst-case time for the carry to settle is about- ns
- ns
- ns
- ns
Answer and solution
Answer: A
In the worst case (e.g. adding to ) a carry made in the lowest stage must pass through all 16 stages in turn: ns. Carry-lookahead adders compute the carries in parallel, so their delay grows only as ; ns is the kind of figure such a design would give.Why people get this wrong: Assuming all full adders work at once (2 ns): each one has to wait for the carry from below.
-
NATHard
A linear-feedback shift register made of flip-flops, with XOR feedback chosen for the longest possible sequence, steps through ______ different states before repeating.Answer and solution
Answer: 31
Five bits have states. With XOR feedback the all-zeros state maps to itself, so it can never be part of the main cycle. A maximal-length (primitive-polynomial) LFSR visits all the others: states. Such registers make pseudo-random bit sequences and CRC checks.Why people get this wrong: Answering 32: the all-zero state is a lock-up state, not part of the cycle.
-
MCQHard
The circuit , built as two AND gates into an OR gate, can glitch (a brief ) when and changes. The extra product term that removes this static hazard isAnswer and solution
Answer: C
With , , but as changes one AND gate turns off before the other turns on (the inverter adds delay), so can dip. The consensus term equals 1 throughout that change and holds the output high. Logically (consensus theorem), so the function is unchanged; only the timing improves.Why people get this wrong: Minimising the expression removes exactly the redundant term that prevents the glitch.
-
MSQHard
Which of these sets of operations are functionally complete (able to build every Boolean function)?Answer and solution
Answer: A, C, D
NAND alone gives NOT () and AND (NAND then NOT), and hence OR by De Morgan. AND with NOT gives OR as . XOR with the constant 1 gives NOT (), and with AND that is complete. AND and OR alone can only build functions that never fall when an input rises (monotone functions); they can never make NOT.Why people get this wrong: Thinking AND and OR are enough because sums of products use them: the complements of the variables are needed as well.
-
NATTop rank
A Boolean function of , , is called symmetric if swapping any two inputs never changes it (so it depends only on how many inputs are 1). The number of different symmetric functions of three variables is ______.Answer and solution
Answer: 16
A symmetric function is fixed by its value for each possible count of 1s: or . That is independent choices of 0 or 1, giving functions (among them the constants, AND, OR, majority and XOR of all three). In general there are symmetric functions of variables, against functions of three variables in all.Why people get this wrong: Counting (all functions) or (input rows).