Combinational and Sequential Logic Crossword
Combinational circuits compute outputs based exclusively on the current state of their inputs: an adder or multiplexer has no memory of what arrived a microsecond ago. Sequential circuits break this restriction by introducing feedback from output to input. That feedback allows a circuit to retain state, oscillate deterministically, or respond to the precise sequence and timing of clock transitions.
This crossword covers that transition in twenty-two terms across four strands:
Combinational building blocks. Half adders, full adders, multiplexers, demultiplexers, encoders, and decoders. These medium-scale functional units calculate arithmetic sums or route signals between devices, operating purely as mathematical combinations where the sequence of prior inputs does not affect the output.
Multivibrators and feedback. Feeding a signal back from an output to an input is the mechanism that turns stateless combinational gates into memory or timing elements. Multivibrators classify by stability: bistable circuits maintain either of two stable voltage states indefinitely; monostable circuits stay stable in one state until pulsed into a temporary quasi-stable state; and astable circuits possess no stable states, oscillating continuously between high and low levels.
Latches and flip-flops. The circuit elements that store single bits. Latches are level-sensitive devices controlled by an enable line, but unclocked configurations risk invalid output states when complementary inputs conflict, or race conditions when signals arrive simultaneously. Flip-flops resolve transparency by restricting data transitions strictly to the active edge of a clock pulse, enabling deterministic operations such as toggling.
Timing, clocks, and counters. The coordination of digital systems in time. Asynchronous ripple counters chain flip-flops together such that clock transitions propagate sequentially, introducing cumulative delay and brief intermediate false states. Synchronous designs clock every stage simultaneously, requiring auxiliary gating logic to coordinate count progression without ripple delay.
How it works
Section titled “How it works”Click a cell and type. Clicking the same cell again switches between across and down, and the clue you are currently in is highlighted.
Check grid marks incorrect letters in red without revealing the correct ones, so a check is a prompt to reconsider a clue rather than a way of being told the answer. Clear grid empties the puzzle. Clues can be ticked off in the list as you finish them.
Where an answer has more than one word, run the words together and leave the spaces out (for example, FLIPFLOP or HALF). Where a clue has a gap in it, the missing word is the answer and the surrounding text clarifies which term is required.
Combinational and Sequential Logic Crossword
Sequential Logic & Combinational Circuits Crossword (22 terms). Where answers have multiple words, omit spaces.
Across
Down
Where to look things up
Section titled “Where to look things up”The arithmetic circuits are in Half Adders, Full Adders and Carry, and signal routing components are demonstrated in Decoders, Encoders, Multiplexers and Demultiplexers.
Feedback and level-sensitive storage are examined in Latches, while clock edges and storage devices are analysed in Flip-Flops. Frequency division and the toggle action of flip-flops are explored in Clocks and the Binary Count Sequence. Cumulative propagation delay in asynchronous circuits is demonstrated in Asynchronous Counters, and Why They Ripple, and the clocking trade-offs required for simultaneous transitions appear in Synchronous Counters, and the Price of Getting It Right. Multivibrator classifications (astable, monostable, and bistable) are covered in the core chapter reading on sequential circuits.
If you get stuck
Section titled “If you get stuck”Leave it and come back. A clue that looks difficult often becomes clear once intersecting letters are in place. Notice that several terms share common technical affixes (such as -stable for multivibrator classifications, or multiplexer and demultiplexer), which can help you deduce the structure of adjacent answers.
© 2026 Derek Molloy, Dublin City University. All rights reserved.