The Quine-McCluskey method differs from K-map minimisation primarily by which feature?
ARestricted to two-variable functions only always
BTabular and scales to many variables
CUses only NAND gates under any condition always
DAlways yields more gates than K-map under any case
Answer & Solution
Correct answer: B. Tabular and scales to many variables
Quine-McCluskey: tabular prime-implicant generation, then prime-implicant chart cover. Algorithmic — tractable for software, scales beyond visual K-map limits.
Related questions
In Verilog HDL, the difference between `always @(*)` and `always @(posedge clk)` blocks isFor a synchronous counter with N flip-flops, the maximum count modulus is which value?A CMOS inverter's static power dissipation is dominated by which mechanism in modern deep-For a Mealy state machine vs a Moore state machine, the key behavioural difference is whicThe HAZARD called a 'static-1 hazard' in combinational logic refers to which?A SRAM cell typically uses how many MOSFETs per stored bit in the standard 6T topology?A Karnaugh map of n variables has how many cells, and adjacent cells differ in which way?For a synchronous D flip-flop, the SETUP TIME requirement specifies which constraint?