Please Login To Continue
K - map 1
Lesson 8 of 20 • 0 upvotes • 8:56mins
Vaishali Shukla
K - map is called Karnaugh Map and it's a method of minimising Boolean expression. Let's study it.
Digital Electronic: GATE
20 lessons • 3h 8m
1
Overview of The Course
6:25mins
2
Number System 1
12:48mins
3
Number System 2
12:01mins
4
Logic Gates
8:21mins
5
Boolean Algebra 1
10:38mins
6
Boolean Algebra 2
11:42mins
7
Boolean Algebra 3
9:12mins
8
K - map 1
8:56mins
9
K - map 2
9:45mins
10
K - map 3
11:45mins
11
K - map 4
9:31mins
12
Don't Care conditions
8:40mins
13
NAND and NOR implementation
7:33mins
14
Parity bit concept
7:10mins
15
Combinational Circuit 1 - Half and Full Adder
9:42mins
16
Combinational Circuit 2 - Full and Half Subtractor
8:22mins
17
Combinational Circuit 3 - Binary Adder and Subtractor
9:31mins
18
Combinational Circuit 4 - Binary Multiplier
8:18mins
19
Combinational Circuit 5 - Encoders
7:44mins
20
Combinational Circuit 6 - Decoders
10:10mins
Crack Gate (Instrumentation) with Unacademy
Get subscription and access unlimited live and recorded courses from India's best educators
Structured syllabus
Daily live classes
Ask doubts
