Lesson 13 of 23 • 4 upvotes • 11:07mins
This lesson is just extension of realizing higher order MUX using lower order MUX with the formulae to calculate number of available MUX required to construct desired MUX.
23 lessons • 3h 46m
Overview (in Hindi)
7:37mins
Introduction to Combinational Circuits (in Hindi)
10:25mins
Adders (in Hindi)
11:54mins
Subtractors (in Hindi)
9:54mins
Adder-Subtractor (in Hindi)
8:34mins
Magnitude Comparator (in Hindi)
9:27mins
BCD Adder (in Hindi)
10:28mins
Full Adder using Half Adder (in Hindi)
8:51mins
Carry Propagation-Look-Ahead Adder (in Hindi)
9:39mins
Introduction to Multiplexers
12:18mins
Implementing Boolean functions using Multiplexers
10:28mins
Realizing higher order MUX using lower order MUX
11:36mins
Cascading of Multiplexers
11:07mins
Parallel to Serial Data Conversion using Multiplexers
10:06mins
Multiplexer as Universal Logic Gate
9:02mins
Problems on Multiplexers
11:52mins
Decoders
10:05mins
BCD to 7-Segment Display Decoders
9:06mins
Encoders
10:03mins
Priority Encoders
8:40mins
Demutiplexer
9:08mins
Numericals on Decoders
9:17mins
Numericals on 7-segment display
6:27mins