Included in at least one reviewed higher-education syllabus.
S4-4.3 Sequential Logic Design
You can distinguish latches from flip-flops, convert between flip-flop types, respect setup/hold times, and design counters, shift registers and synchronous FSMs.
Sequential logic adds memory, and with it time. The latch-versus-flip-flop distinction — level triggered against edge triggered — is the first thing interviewers probe and the source of most beginner bugs, and setup and hold times are where digital design admits it stands on analog reality: violate them and a circuit works usually, which is worse than never. The unit crowns with finite state machines — turning a word problem into states and transitions is the skill that designs almost any control logic — and ASM charts are those machines drawn ready for implementation.
Work through these
Latches vs flip-flops; level vs edge triggering
A latch responds whenever its enable is high; a flip-flop responds only at a clock edge. This is the first thing an interviewer probes and the source of most beginner bugs in sequential design.
SR, D, T, JK and Master-Slave JK flip-flops
The standard one-bit memory elements, each with its own behaviour table, and the master-slave arrangement that made edge triggering possible before dedicated edge circuits existed. D and JK are the two you will actually use.
Flip-flop conversions
Any flip-flop can be made to behave as any other by adding a little logic at its inputs, and the conversion procedure is a standard examination exercise. It also demonstrates that the differences between them are conventions rather than physics.
Setup and hold times
Data has to be steady for a moment before the clock edge and for a moment after it, or the flip-flop stores something undefined. This is where digital design admits it stands on analog reality, and violating these times gives a circuit that works usually, which is worse than never.
Ripple and synchronous counters; shift registers
Counters count clock pulses and shift registers move data along one position per clock. The ripple against synchronous distinction repeats the timing lesson: letting stages clock each other is cheap and accumulates delay.
Finite state machines: design of a synchronous FSM
A finite state machine turns a word problem into a set of states and the transitions between them, and it is the crown of this unit. Once you can do that translation, almost any control logic becomes designable.
Algorithmic State Machine charts
An algorithmic state machine chart is a state machine drawn in a form that maps directly onto an implementation. It is the notation that carries a design from idea to hardware.
Lab: design, simulate and verify a synchronous counter and a small FSM
Design, simulate and verify a synchronous counter and a small state machine. This is the item that proves the unit landed, because a state machine that misbehaves shows exactly which transition was wrong.
Sign in to keep your progress.
Free resources
These videos are on YouTube. Opening the link takes you to YouTube's page. Pressing "Watch here" loads YouTube's player into this page — nothing loads from YouTube until you do. Either way the video comes from Google and uses much more mobile data than a page of text. Something wrong with a link here?
Links last checked 29 Aug 2026.
Stuck here?
Ask a mentor. A real person answers, and they can see exactly which topic you're on. Usually within a couple of working days.
Checking your session…
Topics shown in module order.