STLD

Learn STLD the exam way—clear concepts, worked examples, and 82 focused lessons in electronics engineering.

Instructor: DAKALA SREENIVASULU

Last updated Aug 2026 en

5 learners enrolled

all-levels

This course includes

— on-demand video
Access on mobile & desktop
Full lifetime access
Certificate of completion

Course content

7 sections · 82 lectures

Lec 01: Introduction & Decimal number system Preview
Lec 02: 9's and 10's Complements
Lec 03: Binary number system
Lec 04: Conversions from binary to decimal and vice versa
Lec 05: Binary addition, Subtraction, Multiplication and Division
Lec 06: Signed numbers Representation
Lec 07: 1's and 2's Complement arithmetic
Lec 08: Octal to Binary and vice versa
Lec 09: Octal to Decimal and vice versa
Lec 10: Binary to Hexadecimal and vice versa
Lec 11: Hexadecimal to Decimal and vice versa
Lec 12: Octal to hexadecimal and vice versa
Lec 13: Hexadecimal arithmetic

Lec 14: Classification of codes Preview
Lec 15: BCD Addition and subtraction
Lec 16: BCD subtraction using 9's and 10's complement methods
Lec 17: The Excess Three code
Lec 18: XS-3 subtraction using 9's and 10's complement methods
Lec 19: The gray code and Binary to Gray conversion and vice versa

Lec 20: AND_OR_NOT gates Preview
Lec 21: The Universal gate_NAND
Lec 22: The Universal gate_NOR
Lec 23: Exclusive- OR gate
Lec 24: Exclusive- NOR gate
Lec 25: Inhibit circuits
Lec 26: Example problems
Lec 27: Pulsed operation of logic gates

Lec 28: Axioms and laws of boolean algebra_Part1 Preview
Lec 29: Axioms and laws of boolean algebra_Part2
Lec 30: Reducing Boolean expressions
Lec 31: Boolean functions and their representation
Lec 32: Conversion between Canonical forms
Lec 33: Converting AND-OR-INVERT logic to NAND-NOR logic
Lec 34: Conversion of AOI in to NAND and NOR example

Lec 35: 2-variable K-map Preview
Lec 36: SOP | 3-variable K-Map
Lec 37: POS | 3-variable K-map and minimization
Lec 38: Full adder design | 3-variable k-map
Lec 39: SOP | 4-variable K-Map
Lec 40: POS | 4-variable K-Map
Lec 41: 4-variable k-maps Example_Part-1
Lec 42: 4-variable k-map example_Part-2
Lec 43: dont care conditions | k-map
Lec 44: boolean expressions | k-map
Lec 45: Prime implicants (PI) , Essential PI, Redundant PI, Selective PI
Lec 46 : False Prime implicants, essential false PI, Redundant false PI and Selective false PI
Lec 47 : Example of Prime implicants (PI ) & Essential PI
Lec 48 : 5-variable K-map
Lec 49: Example-1 | 5-Variable k-map_Part-1
Lec 50: Example-1 | 5-Variable k-map _Part-2
Lec 51: Example-2| 5-Variable k-map _Part-1
Lec 52: Example-2 | 5-Variable k-map _Part-2
Lec 53: 6-variable k-map
Lec 54: 6-variable k-map | Example
Lec 55: Quine-McCluskey method

Lec 56: Combinational circuit, Half adder Preview
Lec 57: Full adder
Lec 58: Full adder using two half adders
Lec 59: Half subtractor
Lec 60: Full subtractor
Lec 61: 4-bit Binary parallel adder
Lec 62: 4-bit parallel subtractor
Lec 63: Binary adder- subtractor
Lec 64: The look ahead carry adder
Lec 65: Serial adder
Lec 66: IC parallel Adders
Lec 67: BCD Adder
Lec 68: Excess-3 Adder
Lec 69: Excess-3 Subtractor

Lec 70: 4-bit Binary to Gray code converter Preview
Lec 71: 4-bit Gray to Binary code converter
Lec 72: 4-bit binary to BCD code converter
Lec 73: 4-bit BCD to XS-3 Code converter
Lec 74: 4-bit BCD to Gray Code converter
Lec 75: SOP circuit | Detect the decimal numbers 5 through 12 in a 4-bit gray code input
Lec 76: SOP circuit | Detect the decimal numbers 0,2,4,6, and 8 in 5211 BCD code input
Lec 77: Design 2's complement of a 4-bit binary number
Lec 78: Design Combinational cirucit-1 | Example problem
Lec 79: Combinational cirucit-2 | Example problem
Lec 80: Code converters using IC's
Lec 81: Even parity generator_checker
Lec 82: Odd parity generator_Checker

Explore related topics

Electronics all-levels

Description

STLD is an exam-focused electronics engineering programme designed for ECE / EEE learners building circuit and digital fundamentals for exams (all levels). Lessons are paced for semester revision and competitive practice, with clear explanations you can replay anytime.

You will build device and system intuition for STLD, linking theory to typical university numericals and design questions. Syllabus highlights include NUMBER SYSTEMS, CODES, LOGIC GATES, BOOLEAN THEOREMS & LOGIC OPERATIONS, K-map, and COMBINATIONAL LOGIC CIRCUITS DESIGN. Across 82 lessons, you will move from foundations to problem-solving patterns that show up in university papers and placement tests.

Taught by DAKALA SREENIVASULU, this course keeps theory short and practice heavy—so you can revise faster, spot examiner cues, and build confidence before mocks and finals.