Siksha Sarovar

Siksha Sarovar (sikshasarovar.com) is a free educational web application that helps students in India learn programming and prepare for academic and competitive exams. The platform offers structured coding courses (C, C++, Python, Java, HTML, CSS, PHP, Power BI, AI, Machine Learning, Data Science), complete university curriculum notes for BCA/MCA students with previous year question papers, Class 10 and Class 12 CBSE/HBSE school notes, and dedicated preparation material for SSC, UPSC, Banking, Railway and other government exams. Browsing the site is completely free and requires no account. Users may optionally sign in with Google solely to save their learning progress, quiz scores and personal preferences across devices.

Privacy Policy | Terms of Service | Contact Siksha Sarovar | About Siksha Sarovar

v4.0.9 · PWA
Siksha Sarovar logo
Siksha Sarovar
Your Learning Universe

Siksha Sarovar is a free e-learning platform for coding courses, BCA university notes and competitive exam preparation. Optional Google sign-in saves your learning progress across devices.

Initializing knowledge base…
Compiling modules 0%

Flip-Flops: SR, D, JK, T — Truth Tables, State Diagrams and Conversions

Lesson 8 of 17 in the free Computer Organization and Architecture notes on Siksha Sarovar, written by Rohit Jangra.

JK Flip-Flop State Diagram

---

SR Flip-Flop Truth Table

SRQ(t+1)Notes
00Q(t)No change (memory)
010Reset
101Set
11XInvalid/Forbidden — both outputs undefined

---

D Flip-Flop Truth Table

DQ(t+1)
00
11

D flip-flop simply captures the D input on the clock edge. The invalid state of SR is eliminated by tying S=D and R=D'.

---

JK Flip-Flop Truth Table

JKQ(t+1)Description
00Q(t)No change
010Reset
101Set
11Q'(t)Toggle (flips current state)

JK is the most versatile flip-flop — no invalid state, has toggle mode.

---

T Flip-Flop Truth Table

TQ(t+1)Description
0Q(t)No change
1Q'(t)Toggle

T flip-flop: T=0 hold, T=1 toggle. Built from JK with J=K=T.

---

SR Flip-Flop State Diagram

---

Excitation Tables

Excitation tables show what inputs are needed to achieve a desired state transition (used in sequential circuit design).

SR Flip-Flop Excitation:

Q(t)Q(t+1)SR
000X
0110
1001
11X0

JK Flip-Flop Excitation:

Q(t)Q(t+1)JK
000X
011X
10X1
11X0

D Flip-Flop Excitation: Q(t+1) = D → D = Q(t+1) always.

T Flip-Flop Excitation: T = Q(t) ⊕ Q(t+1).

---

FF Conversion: JK to D Flip-Flop

To implement D flip-flop using JK flip-flop:

  • When D=0: need Q(t+1)=0 → J=0, K=X → set J=D=0, K=D'=1
  • When D=1: need Q(t+1)=1 → J=1, K=X → set J=D=1, K=D'=0

Result: J = D, K = D' (feed D to J and NOT D to K)

---

Race-Around Condition and Master-Slave

In a level-triggered JK FF with J=K=1: during clock HIGH, output toggles multiple times (races around). This is the race-around condition.

Master-Slave solution: Two flip-flops in cascade. Master captures input when CLK=1. Slave updates output when CLK=0. Output changes only once per clock cycle, eliminating race-around.

---

Comparison Table

FF TypeInputsInvalid StateSpecial FeatureMain Use
SRS, RYes (S=R=1)Simplest FFBasic storage, flags
DDNoneTransparent latch / edge captureRegisters, pipelines
JKJ, KNoneHas toggle modeCounters, state machines
TTNoneToggle on T=1Binary counters
📝 Exam Tips: - SR: S=R=1 is forbidden. JK: J=K=1 causes toggle (not forbidden) - D FF: Q(t+1) = D — simplest excitation - Edge-triggered FFs sample input only at clock edge, avoiding race-around - Master-slave JK eliminates race-around: master loads on CLK=1, slave fires on CLK=0