← 🔌 Combinational Circuits
Subtopic 6 of 6

3.6Static hazards

The idea

A static hazard is a brief unwanted pulse (glitch) at the output of a circuit when one input changes and the output is supposed to stay constant. It appears because different paths have different delays.

Think of it like this: Two traffic lights that do not switch at exactly the same moment: for an instant both are red.

Why it exists

GATE asks which expressions have hazards and how to remove them with the consensus term.

How it works

  1. Find two adjacent 1s on the K-map that are not covered by a common group.
  2. Change the variable that separates them while the others hold the cover terms at 1.
  3. The first term turns off a gate delay before the second turns on: the output dips to 0.
  4. Add the consensus term (a group covering both cells) so the output stays 1.

Worked example: F = AB + A′C with B = C = 1

When A falls, AB turns off one step before A′C turns on, so F glitches to 0. Adding BC keeps F high all the time.

Now play with it

  • →Switch between the two circuits and watch row F.
  • →Notice that the red cell appears only in the version without BC.

B = C = 1 the whole time and A falls from 1 to 0 at t = 2. Every gate has a delay of one time unit. Logically F stays 1 (the output is B·1 either way).

signal012345678
A110000000
A'000111111
AB111000000
A'C000011111
F111101111

F dips to 0 for a moment: a static-1 hazard. AB turns off before A′C turns on (the inverter makes A′ late).

Check yourself

The circuit F = AB + A′C can show a static-1 hazard when

Remember: Adjacent 1s in different groups cause a static-1 hazard; add the consensus term to fix it.
Exam notes (the dense version)

A static-1 hazard is a momentary 0 glitch when the output should stay 1; it appears in a two-level SOP when two adjacent 1s on the K-map are covered by different groups (e.g. F = AB + A′C when B = C = 1 and A changes). Fix it by adding the redundant consensus term (BC). A static-0 hazard is the dual in POS. A dynamic hazard is several glitches while the output should change once and needs three or more levels of logic. A fully redundant-free SOP built from all prime implicants is hazard-free for single-input changes.

Previous year questions: Combinational Circuits (10)

PYQs are grouped by topic, so this is the full set for Combinational Circuits; try the ones that match this subtopic. Open all 10 on the topic page.