Digital Electronics Quick Revision Notes (DSSSB TGT CS 2014–2026)
Digital Electronics accounts for 8 to 14 marks in every DSSSB TGT Computer Science (Post Code 91/20, 39/22, 55/24, and 2025–2026 cycles) examination. Below is a high-yield summary of Combinational Circuits, Sequential Circuits, and Flip-Flops compiled from 12 years of DSSSB exam trends.
1. Combinational vs. Sequential Logic Circuits
| Feature | Combinational Circuits | Sequential Circuits |
|---|---|---|
| Output Dependence | Depends only on present inputs. | Depends on present inputs + past outputs (memory). |
| Memory / Feedback | No memory elements; no feedback path. | Contains memory elements (Flip-Flops) & feedback path. |
| Clock Signal | Not required (Asynchronous). | Required for Synchronous circuits (Clocked). |
| Key Examples | Half/Full Adder, Subtractor, MUX, DEMUX, Encoder, Decoder, Comparator, Code Converter. | Flip-Flops, Latches, Registers (SISO, SIPO, PISO, PIPO), Counters (Ripple, Synchronous, Ring, Johnson). |
2. Essential Combinational Circuit Formulas
• Half Adder: Sum = A ⊕ B | Carry = A · B (Requires 1 XOR + 1 AND gate; or 5 NAND / 5 NOR gates).
• Full Adder: Sum = A ⊕ B ⊕ Cin | Cout = AB + BCin + ACin (Requires 2 Half Adders + 1 OR gate; or 9 NAND / 9 NOR gates).
• Half Subtractor: Diff = A ⊕ B | Borrow = A' · B.
• Multiplexer (MUX): 2n : 1 MUX has 2n data inputs, n select lines, and 1 output. Acts as a Universal Logic Circuit & Parallel-to-Serial converter.
• Decoder: n-to-2n lines (active high/low). Used for memory address decoding and minterm generation.
• Full Adder: Sum = A ⊕ B ⊕ Cin | Cout = AB + BCin + ACin (Requires 2 Half Adders + 1 OR gate; or 9 NAND / 9 NOR gates).
• Half Subtractor: Diff = A ⊕ B | Borrow = A' · B.
• Multiplexer (MUX): 2n : 1 MUX has 2n data inputs, n select lines, and 1 output. Acts as a Universal Logic Circuit & Parallel-to-Serial converter.
• Decoder: n-to-2n lines (active high/low). Used for memory address decoding and minterm generation.
3. Flip-Flops: Characteristic Equations & Excitation Summary
| Flip-Flop | Characteristic Equation (Qn+1) | Key Behavior & Exam Traps |
|---|---|---|
| SR Flip-Flop | Qn+1 = S + R'Qn (with SR = 0) | S=1, R=1 is Invalid / Forbidden / Indeterminate state. |
| JK Flip-Flop | Qn+1 = JQ'n + K'Qn | Eliminates invalid state. J=1, K=1 causes Toggle (Q'n). Suffers from Race-Around Condition in level-triggered mode when tp < tw. |
| D Flip-Flop | Qn+1 = D | Delay / Data FF. Used in Shift Registers and buffers. |
| T Flip-Flop | Qn+1 = T ⊕ Qn | Toggle FF (J=K=T). Used in Counters and frequency division (fout = fin / 2). |
• Race-Around Condition Fix: Use Master-Slave JK Flip-Flop or Edge-Triggered Flip-Flops.
• Counters & Registers: An n-bit Ripple/Synchronous Counter has 2n states (MOD-2n). An n-bit Ring Counter has n states; an n-bit Johnson (Twisted Ring) Counter has 2n states.
• Counters & Registers: An n-bit Ripple/Synchronous Counter has 2n states (MOD-2n). An n-bit Ring Counter has n states; an n-bit Johnson (Twisted Ring) Counter has 2n states.
.png)