ELECTRONICS

Digital Electronics and Logic Design

24ERJ303 · S3 · 5 credits

5 modules · Practice & PYQs ready

§
Syllabus
Loading syllabus…
Manage →
⚡ DAY-BEFORE EXAM

Have an exam tomorrow?

Get a high-yield attack plan focused on maximum marks per minute. Zero fluff, strict PYQ priority, active recall, and trap avoidance.

Strategy: High-yield concepts + PYQs + weak areas

Tap a module to mark as weak
PRIORITY A
Flip-Flops, Registers, and Counters: Sequential Logic Design

Why:2 high-weightage exam questions · Formula-heavy module · Many definitions to memorize · Has worked numerical examples

+ Mark Weak
PRIORITY A
Number Systems and Logic Gate Fundamentals

Why:2 high-weightage exam questions · Formula-heavy module · Many definitions to memorize · Has worked numerical examples · Foundation module

+ Mark Weak
PRIORITY B
State Machines, D/A and A/D Converters, Programmable Logic Devices

Why:3 high-weightage exam questions · Many definitions to memorize

+ Mark Weak
PRIORITY B
Boolean Algebra and Combinational Circuit Design

Why:2 high-weightage exam questions · Formula-heavy module · Many definitions to memorize · Has worked numerical examples

+ Mark Weak
PRIORITY C
Digital Logic Components and Verilog Programming

Why:2 high-weightage exam questions · Formula-heavy module · Many definitions to memorize

+ Mark Weak
Modules
5 modules
PYQs · 27 questionsFull bank →
Browse by moduleexpand

M1Number Systems and Logic Gate Fundamentals

high

Convert a given number between binary, octal, decimal and hexadecimal.

high

Represent a given decimal number in sign-magnitude, 1's complement and 2's complement form, and perform addition/subtraction using 2's complement.

medium

Encode a given decimal number in BCD, Excess-3, and Gray code.

medium

Explain the working of a parity bit for error detection with an example.

medium

Differentiate TTL and CMOS logic families.

low

Differentiate fixed-point and floating-point number representation.

M2Boolean Algebra and Combinational Circuit Design

high

Simplify a given 4-variable Boolean expression using a K-map (with or without don't-care terms), and draw the resulting logic circuit.

high

Design and draw a full adder / full subtractor circuit, deriving its truth table and Boolean expressions.

medium

Design a 4-bit parallel binary adder/subtractor and explain the ripple-carry delay problem.

medium

Explain how a carry look-ahead adder eliminates ripple-carry delay.

low

Convert a given Boolean expression between SOP and POS form.

M3Digital Logic Components and Verilog Programming

high

Write Verilog code (gate-level, dataflow, or behavioral) for a given combinational circuit (half/full adder, mux, demux, decoder, encoder).

high

Differentiate multiplexer, demultiplexer, encoder, and decoder, with their input/output sizing relationships.

medium

Design a BCD-to-seven-segment decoder and explain its working.

medium

Explain the block-level architecture of an ALU.

low

Write a Verilog testbench for a given basic gate or combinational module.

M4Flip-Flops, Registers, and Counters: Sequential Logic Design

high

Convert one flip-flop type into another (e.g. design a JK flip-flop using a D flip-flop) using an excitation table and K-map.

high

Design a synchronous Mod-N counter (state table → excitation table → K-map → logic circuit).

medium

Design and explain a ripple (asynchronous) counter, identifying its propagation delay limitation.

medium

Explain the working of a ring counter and a Johnson counter, including their state counts.

medium

Differentiate the four shift register configurations (SISO, SIPO, PISO, PIPO).

low

Explain the race-around condition in a JK flip-flop and how a master-slave configuration solves it.

M5State Machines, D/A and A/D Converters, Programmable Logic Devices

high

Differentiate Moore and Mealy machines, and draw the state diagram for a given sequence detector.

high

Explain the R-2R ladder DAC and why it's preferred over the weighted-resistor DAC.

high

Differentiate flash ADC and successive approximation ADC in terms of speed and hardware complexity.

medium

Differentiate PAL, PLA, and FPGA.

medium

Implement a given Boolean function using a PAL or PLA.

Notes / Resources

Exam-focused notes are optional context — Continue Learning above works even without them.

Module Progressnot assessed
Module overview

What this module covers

What it's about
This module covers number system conversions and codes (binary, octal, hex, ASCII, Excess-3, Gray, BCD, parity), signed number representation and arithmetic, fixed/floating point representation, and the basics of TTL and CMOS logic families.
Why it matters in exams
Number system conversions and signed-number arithmetic (especially 2's complement) are 'free marks' questions that come up almost every semester — they're mechanical and fast once practiced, so they're worth nailing down completely before anything else.
Think of it like…
2's complement isn't a trick — it's what happens if you let subtraction 'wrap around' a fixed-size odometer. On a 4-digit car odometer, driving backward 1 mile from 0000 rolls to 9999, not −1. 2's complement just picks that same wrap-around point so hardware never needs a separate subtract circuit — it just adds.
AI STUDY TOOLSDigital Electronics and Logic Design → Number Systems and Logic Gate Fundamentals

≈ 9h of curated content available across this subject.