ChipKraftChipKraft
Start Learning

Logic & CMOS Challenges

Solve interactive digital logic puzzles, simplify boolean expressions, and optimize CMOS transistor circuits. New challenges every week!

Progress
0 / 0 Solved
📅 SELECT WEEKWeek 4 — Finite State Machines (FSM) & Counters
📕 Week 4 — Finite State Machines & Synchronous Counters9 Challenges

B1: Mealy vs Moore FSM Difference

In a Moore Finite State Machine, outputs depend on:

Moore FSM: Output Y = f(?)

B2: 2-Bit Modulo-4 Counter

How many distinct flip-flops are required to design a Modulo-4 synchronous binary counter?

States = 4 → Flip-Flops = ?

B3: One-Hot State Encoding

For an FSM with 5 states, how many flip-flops are needed when using One-Hot encoding?

One-Hot: 1 FF per state
🔄

New challenges every week!

We add fresh digital logic and CMOS challenges every week. Come back for more!