Lesson 4 of 34 • 24 upvotes • 11:57mins
In this video, I have taught about positive and negative logic and how to find dual and complement of a boolean expression.
34 lessons • 7h 4m
Overview - Course on Digital Electronics for GATE and IES
11:35mins
Boolean Algebra
12:22mins
SOP, POS and Canonical Forms
12:35mins
Dual and Complement of a Boolean Expression
11:57mins
Logic Gates - I
14:35mins
EXOR Gate
12:08mins
EXNOR Gate
13:48mins
Universal Gates
12:48mins
Implementation using NAND and NOR Gates
11:09mins
Introduction to Combinational Circuits + Half Adder
11:22mins
Full Adder
12:42mins
Parallel Adders
11:31mins
Look Ahead Carry Adder
13:16mins
Introduction to Multiplexers
11:16mins
2 to 1, 4 to 1 and 8 to 1 MUX
14:27mins
Implementation of Boolean Function using Multiplexer
14:43mins
Problems on Implementation of Boolean Function using a multiplexer
11:32mins
Multiplexer as a Universal Gate
10:00mins
Demultiplexers
10:52mins
Decoders
10:52mins
Encoders
9:59mins
Priority Encoders
10:59mins
BCD Adder
13:31mins
Excess 3 Code
12:47mins
GATE 2018 Questions - Combinational Circuits
14:43mins
Previous Year GATE Questions
12:35mins
Previous Year GATE Questions (Part-II)
12:39mins
Introduction to K-Map
15:00mins
2-Variable K Map
15:00mins
3-Variable K Map
15:00mins
Rules for grouping in K Map
11:24mins
Simplification of Boolean Expression using K Map
10:02mins
Minimization with Max Terms
13:36mins
Don't Care in K-Map
11:08mins