Digital Circuits (Hindi)

   Tuesday, December 12, 2023   

Starting a new Lecture Notes Series on Digital Circuits

Youtube Lecture Playlist Credits 

Channel Name: Dopamine

So Let Us Start to This Journey of Learning 

Digital Circuits By Lecture Notes together!

Lecture 1: Digital Circuits Introduction

Lecture 2: Digital Design & Digital Computer

Lecture 3: Introduction to Number System

Lecture 4: Conversion of Number from One Radix to Another

Lecture 5: Conversion from Decimal to Any Other Base

Lecture 6: Conversion from Binary to Any Other Base

Lecture 7: Conversion From Octal & Hexadecimal to Any Other Number System

Lecture 8: Number Representation : Signed Number & Floating Point Number

Lecture 9: Operations On Number System : Addition, Subtraction, Multiplication & Division

Lecture 10: R's and R-1's Compliment Introduction | 1's and 2's Compliment

Lecture 11: Subtraction Using R's and R 1's Compliment

Lecture 12: Overflow Conditions and Different Types of Overflow

Lecture 13: Binary Codes Introduction and Types of Codes in Digital Circuits

Lecture 14: BCD Codes

Lecture 15: Excess 3 Codes

Lecture 16: Gray Code

Lecture 17: Alphanumeric Code

Lecture 18: Error Detection and Corection Coding

Lecture 19: Trick : Decimal To Binary Number System Conversion

Lecture 20: Floating Point Representation

Lecture 21: Fundamental Postulates of Boolean Algebra | Digital Circuits

Lecture 22: Fundamental Postulates and Laws of Boolean Algebra - Proof

Lecture 23: DeMorgan's Theorem and Principle of Duality with - Proof

Lecture 24: DeMorgan's Theorem and Principle of Duality with - Proof

Lecture 25: Boolean Function | Digital Circuits

Lecture 26: M Notations : Minterm and Maxterm

Lecture 27: Truth Table | Digital Circuits

Lecture 28: De Morgan's Theorem and Principle of Equality | Digital Circuits

Lecture 29: Karnaugh Map Method of Minimization Introduction | K Map-1 | Digital Circuits

Lecture 30: Simplification of Boolean Expression Using Karnaugh Map | K Map 2 | Digital Circuits

Lecture 31: Simplification of Incompletely Specified Functions using Karnaugh Map | K Map - 3

Lecture 32: Simplification of POS Expressions using Karnaugh Map | K Map 4 | Digital Circuits

Lecture 33: Simplification of 5 Variable Boolean Expressions using Karnaugh Map

Lecture 34: Simplification of 6 Variable Boolean Expressions using Karnaugh Map | K Map 6

Lecture 35: Quine Mcclusky Tabular Method for Boolean Function Minimisation

Lecture 36: Quine Mcclusky Using Don't Care Terms

Lecture 37: Introduction to Logic Gates, Not Gate, And Gate, Or Gate

Lecture 38: Logic Gates NAND Gate, NOR Gate, EXOR Gate, EXNOR Gate

Lecture 39: NAND Gate as a Universal Gate

Lecture 40: NOR Gate as a Universal Gate

Lecture 41: NAND NAND Logic and NOR NOR Logic

Lecture 42: Combination Logic Introduction, Analysis and Design Procedure

Lecture 43: Adder Half Adder and Full Adder

Lecture 44: Subtractor Half Subtractor anf Full Subtractor

Lecture 45: Look Ahead Carry Adder & Parallel Adder & Serial Adder

Lecture 46: BCD Adder & Subtractor I Digital Circuits