IITIAN1997 STUDIO

Digital electronics

JLEE ECE / ETE · 10 practice questions with answers

Practise and take a mock test →

Logic, combinational and sequential circuits, converters

Topics: Number systems and codes; Boolean algebra and K-maps; logic gates and families; adders, multiplexers, decoders, encoders; flip-flops, registers and counters; memories; ADC and DAC.

Number systems and codes

Binary, octal and hexadecimal convert by grouping bits in 3s and 4s. BCD codes each decimal digit in 4 bits; excess-3 adds 3 to each digit; Gray code changes only one bit between neighbours (binary to Gray: keep the first bit, then XOR each pair of neighbours). ASCII uses 7 bits per character.

  • BCD: 4 bits per decimal digit
  • Gray: one bit changes at a time
  • Hex digit = 4 bits

Example: Convert binary 1011 to Gray code.

  1. Keep the first bit: 1; then 1⊕0 = 1, 0⊕1 = 1, 1⊕1 = 0.
  2. Gray = 1110.

Answer: 1110

Example: Write 59 in BCD.

  1. 5 = 0101, 9 = 1001.
  2. BCD = 0101 1001.

Answer: 0101 1001

Boolean algebra and Karnaugh maps

Boolean laws (A + A′ = 1, A·A′ = 0, A + AB = A, De Morgan) simplify logic. A Karnaugh map places minterms in Gray-code order so that neighbours differ in one variable; grouping adjacent 1s in blocks of 1, 2, 4 or 8 (edges wrap around) eliminates the changing variables. NAND and NOR are universal gates. Logic families: TTL (5 V), CMOS (low power, wide supply).

  • Group 1s in powers of two
  • Edges of a K-map wrap
  • NAND and NOR are universal

Example: Simplify F(A, B, C) = Σm(0, 2, 4, 6).

  1. All four minterms have C = 0; A and B change across the group.
  2. F = C′.

Answer: C′

Example: Simplify F(A, B) = Σm(1, 2, 3).

  1. Group m1 and m3 (B = 1) and m2 and m3 (A = 1).
  2. F = A + B.

Answer: A + B

Combinational and sequential circuits, memories and converters

A 2ⁿ-to-1 multiplexer needs n select lines; an n-to-2ⁿ decoder turns a code into one active line. A half adder gives sum A ⊕ B and carry AB. Flip-flops (SR, JK, D, T) build registers and counters; a MOD-N counter needs at least ⌈log₂N⌉ flip-flops.

Memory with n address lines holds 2ⁿ words. An n-bit ADC or DAC with reference V_ref has resolution V_ref/2ⁿ.

  • 2ⁿ:1 mux needs n select lines
  • MOD-N counter: ⌈log₂N⌉ flip-flops
  • Resolution = V_ref/2ⁿ

Example: How many flip-flops make a MOD-10 counter?

  1. 2³ = 8 < 10 ≤ 16 = 2⁴.
  2. 4 flip-flops.

Answer: 4

Example: Find the resolution of an 8-bit ADC with a 5 V reference.

  1. 5/2⁸ = 5/256.
  2. ≈ 19.5 mV.

Answer: ≈ 19.5 mV

Example: A memory chip has 12 address lines and 8 data lines. Find its size.

  1. 2¹² = 4096 words of 8 bits.
  2. 4 KB.

Answer: 4 KB

De Morgan’s theorems (AB)′ = A′ + B′ and (A + B)′ = A′B′ let NAND and NOR build any function. A half-adder gives sum A⊕B and carry AB; a full adder adds a carry-in. A 2ⁿ:1 multiplexer has n select lines; a decoder activates one of 2ⁿ outputs. An SR latch has an invalid state; the JK flip-flop removes it by toggling when J = K = 1; a D flip-flop stores input; a T toggles. An n-bit ripple counter divides the clock by 2ⁿ. CMOS uses little static power and TTL is faster in older logic. An n-bit DAC has resolution V_FS/(2ⁿ − 1). Flash ADCs are fastest; successive-approximation types are common.

  • Mod-N counter resets at N; needs ⌈log₂N⌉ flip-flops.
  • SISO, SIPO, PISO, PIPO shift registers.
  • SRAM uses flip-flops; DRAM uses capacitors and must refresh.
  • Race-around in JK is cured by master-slave design.
  • Gray code differs by one bit between neighbours.

Key formulas

  • (A + B)′ = A′B′
  • S = A⊕B, C = AB
  • f_out = f/2ⁿ
  • Res = V_FS/(2ⁿ − 1)

Practice questions

A half adder’s carry is

  1. A + B
  2. AB
  3. A⊕B
  4. A′B
Show the answer

Answer: B. AB AND.

A half adder’s sum is

  1. A + B
  2. AB
  3. A⊕B
  4. (AB)′
Show the answer

Answer: C. A⊕B XOR.

An 8:1 multiplexer has select lines

  1. 2
  2. 3
  3. 4
  4. 8
Show the answer

Answer: B. 3 2³.

A JK flip-flop with J = K = 1

  1. resets
  2. sets
  3. toggles
  4. holds
Show the answer

Answer: C. toggles Complement.

The race-around condition is cured by

  1. master-slave design
  2. more gates
  3. higher clock
  4. no feedback
Show the answer

Answer: A. master-slave design Edge separation.

A 4-bit ripple counter divides the clock by

  1. 4
  2. 8
  3. 16
  4. 32
Show the answer

Answer: C. 16 2⁴.

DRAM needs refresh because it stores data in

  1. flip-flops
  2. capacitors
  3. fuses
  4. magnets
Show the answer

Answer: B. capacitors Charge leaks.

The fastest ADC type is

  1. flash
  2. dual-slope
  3. counter
  4. SAR
Show the answer

Answer: A. flash Parallel comparators.

A decoder with 3 inputs has outputs

  1. 3
  2. 6
  3. 8
  4. 16
Show the answer

Answer: C. 8 2³.

A D flip-flop is used mainly for

  1. data storage
  2. analogue gain
  3. rectification
  4. oscillation only
Show the answer

Answer: A. data storage Delay/latch.

The practice questions were written for this studio; they are not copied from ASTU papers. ASTU publishes no topic syllabus for these exams, so the topics are an informed guide based on diploma courses, not an official list.

Practise and take a mock test →