Assess students' ability to apply Boolean algebra and logic gates to design, simplify, and analyze combinational digital circuits. Include problems that require algebraic simplification (use of De Morgan's laws, consensus theorem, etc.), minimization via Karnaugh maps, conversion between truth tables, Boolean expressions, and gate-level schematics, and basic circuit design tasks (e.g., half/full adders, multiplexers, decoders) with attention to gate count and verification by truth table. Require step-by-step justification and final simplified schematics or expressions.