Practice
Digital logic design practice problems
These are circuit problems. You place gates, multiplexers and flip flops on a canvas, wire them, and the simulator checks your circuit against a truth table or a clocked test sequence.
916 problems60 free to solve190 easy, 416 medium, 310 hard
Some problems ask for a build from scratch, some hand you a broken circuit to repair, and some ask you to read a circuit or a timing diagram and answer about it.
What these problems cover
- Number systems, Boolean algebra and Karnaugh maps
- Gate level design and minimization
- Adders, multiplexers, encoders, decoders and ALU slices
- Latches, flip flops and their timing
- Counters, shift registers, ring and Johnson counters
- Moore and Mealy state machines
Free to start
Solve these with a free account. Every other statement on this page is free to read.
Problems by track
Digital Foundations58
- Hex Nibble to Binary
- Binary to Hex
- Decimal to Binary Using Repeated Division
- Binary Fraction to Decimal
- Decimal Fraction to Binary
- Decimal to Octal
- Octal to Binary via Grouping
- Hex to Octal via Binary
- Memory Address Space from Bus Width
- BCD vs Binary: Identify the Valid Code
- Decimal to BCD Encoding
- BCD Addition with Carry Correction
Gate-Level Logic62
- Extract Expression from a Two-Level AND-OR Circuit with Fan-Out
- Extract Expression from a Two-Level NAND-NAND Circuit
- Extract Expression from a Three-Level Circuit with Mixed Gate Types
- Identify the Function Computed by a Multi-Level NAND Circuit Using Bubble Pushing
- Determine Whether Two Different Circuits Implement the Same Function
- Three-Term SOP with Single Literal
- Build F = A(B + C) from Factored Form
- Build the Circuit for F = (A+B)(C+D)(E+F) Under a Two-Input Gate Constraint
- Shared Subexpression: F1 = AB + C, F2 = AB + D
- Identify the Subexpression Shared Between Two Output Paths in a Multi-Output Circuit
- Two-Input OR Gate Using Only Two-Input NAND Gates
- Three-Variable Majority Function Using Only NAND Gates
Combinational Building Blocks41
- Build a Half Adder from Gates
- Full Adder from Half Adders
- Carry-Out of a 1-bit Full Adder (Gate-Level)
- NAND-only Full Adder
- Debug a Full Adder Where Sum and Carry Outputs Are Swapped at the Output Pins
- Build a Half Subtractor
- Full Subtractor from Half Subtractors
- Debug a Full Subtractor with Wrong Borrow Expression
- 4-Bit 2's Complement Adder/Subtractor
- Debug 2-Bit Adder/Subtractor
- 4-Bit Ripple Carry Adder
- 4-bit Carry Lookahead Block
Latches and Flip-Flops126
- SR NOR Latch: Basic Construction
- SR NOR Latch: Normal Operation Waveform Trace
- SR NOR Latch: Forbidden State Behavior
- SR NOR Latch: Race Condition on Simultaneous Forbidden-State Release
- SR NOR Latch: Memory Phase Duration Verification
- SR NOR Latch: Q_bar Polarity and Active Level
- SR NOR Latch: Missing Cross-Coupling Wire Debug
- SR NOR Latch: Set-Dominant Configuration
- SR NAND Latch: Active-Low Input Construction
- SR NAND Latch Active-Low Operation
- SR NAND Latch: Forbidden State
- SR NAND Latch: Simultaneous Forbidden-State Release Race
Counters138
- 4-Bit Ripple Binary Counter from T Flip-Flops
- 4-Bit Ripple Counter from D Flip-Flops Wired as Toggle
- 4-Bit Ripple Counter: Propagation Stagger
- Ripple Counter Maximum Clock Frequency Derivation
- Ripple Counter with Asynchronous CLEAR
- Ripple Counter CLR Timing Waveform
- 4-Bit Ripple Down-Counter
- Ripple Down-Counter Waveform Trace
- Ripple Counter: Wrong Trigger Stage Debug
- Ripple Counter: Q2 Stuck-at-0 Fault Debug
- Ripple Counter: Glitch Duration Calculation
- Ripple Counter Cascaded for 8-Bit Count
Shift Registers80
- 4-Bit SISO: Basic Chain Construction
- 4-Bit SISO: Continuous Data Stream Trace
- 4-Bit SISO with Shift Enable
- SISO as a Programmable Delay Line: Tap Selection
- SISO: Clock Missing on One Stage Debug
- SISO: Wrong D-to-Q Wiring Debug
- 4-Bit SISO: Pipeline Latency Waveform
- SISO with Synchronous Clear
- Two 4-Bit SISOs in Series: Total Latency
- SISO Recirculating Memory
- SISO: Recirculating Register Waveform Verification
- 4-Bit SIPO: Construction from SISO
Finite State Machines18
- Moore FSM Output Delay Analysis
- Moore vs Mealy Output Area
- Mealy Output Glitch Detection
- Explicit vs Implicit FSMs
- ROM Based State Machine Next State Logic
- One Hot Enum Encoding Verification
- Priority Encoder vs One Hot Leading Zero
- Overlapping Sequence Detector with Timeout
- Off By One Cycle in State Machine Timeout
- Traffic Light with Emergency Preemption
- UART Receiver State Machine
- Debug Sequential: Missing State Machine Reset
Arithmetic and ALU Design31
- Two's Complement Inverter
- Adder Subtractor Mode Control
- Signed Overflow Detection
- Sign Extension Array
- Generate and Propagate Logic
- Carry Select Adder Multiplexer Stage
- Ripple Carry Critical Path Analysis
- 1-Bit ALU Slice
- ALU Zero Flag Logic
- ALU Less Than Flag Logic
- ALU Flag Evaluation Branch Logic
- Composite ALU Datapath
Datapath and Storage28
- Data Register with Synchronous Enable
- Register Priority Control Logic
- Basic Register File Address Decoding
- Dual Read Port Multiplexing
- Read After Write Hazard and Bypass Forwarding
- Register File Write Enable Glitches
- Circular Buffer Write Pointer Logic
- FIFO Full and Empty Flag Generation
- FIFO Almost Full Warning Logic
- Shift Register Based LIFO Stack
- Stack Pointer Up Down Control
- Stack Overflow Protection
Clocking and Synchronization85
- Simple Divide by 2 Clock Generator
- Synchronous Divide by 4 Clock Generator
- Ripple Divide by 4 Phase Delay Analysis
- Divide by 8 with 50 Percent Duty Cycle
- Power of 2 Divider Chain
- Divide by 3 with 33 Percent Duty Cycle
- Divide by 3 with 50 Percent Duty Cycle
- Divide by 5 with 20 Percent Duty Cycle
- Divide by Three with 50 Percent Duty Cycle
- Programmable Divider Selector
- Glitch Analysis in Combinational Divider Decoding
- Clock Phase Shifter 90 Degrees
Fault Testing and Verification27
- Single Fault Activation
- Fault Propagation and Noncontrolling Values
- Reconvergent Fanout Masking
- Fault Equivalence in Basic Gates
- Fault Dominance and Collapsing
- Controllability Bottlenecks
- Observability Blockers
- Test Point Insertion Logic
- Untestable Faults in Hazard Free Logic
- Redundant Logic Identification
- Debug Combinational: Swapped Logic Gates
- Debug Combinational: Priority Encoder Masking Bug
Interface and Communication Circuits77
- Basic Rising Edge Detector
- Basic Falling Edge Detector
- Dual Edge Detector
- Delayed Edge Detector
- Maskable Edge Detector
- Shift Register Debouncer
- Symmetric Shift Register Debouncer
- Counter Based Debouncer
- Early Reset Debouncer
- Digital Hysteresis Filter
- Glitch Rejector
- Synchronizer and Edge Detector Combo
Interview Circuit23
- The Hidden LFSR
- The Reconvergent Glitch
- Strict Round Robin Arbiter
- The 75 Percent Adder
- The Backwards Synchronizer
- Setup Time Under Skew
- Shift Register Hold Violation
- The Unsafe Ring Counter
- Maximum Frequency of a 16 Bit RCA
- Memory Sizing for an 8 Bit Multiplier
- Digital Combination Lock
- Glitchless Clock Multiplexer
More problems122
- 1-Bit Magnitude Comparator
- 1-to-4 Demultiplexer from AND and NOT Gates
- 2-bit Ring Counter
- 2:4 Decoder with Active-High Enable
- 3-bit Ripple Counter from Toggle Flip-Flops
- Active Low Reset Polarity Mismatch
- Arithmetic Shift vs Logical Shift
- Bit Reversal Synthesis
- Constant Folding Optimization
- D Latch from a 2:1 MUX
- Debugging ROM Latch Inference
- Division by Power of Two
How your answer is checked
Your circuit runs on the same simulation engine in the browser and on the server. It is checked against the problem's test vectors; a sequential circuit is clocked through them and its outputs compared on every cycle.
Questions
- Do I need to know Verilog for these?
- No. Circuit Lab problems are built from parts on a canvas. When you want to write the same designs as code, the Verilog problems cover them.
- Is this useful for university digital electronics courses?
- The tracks follow the order most digital logic courses use: number systems, gates, combinational blocks, then sequential circuits and state machines.
- Are these problems free?
- The first problems of every track are free with an account, and every problem statement is free to read.