K Maps | Solving Boolean Expression using K Maps | SOP and POS
3,322 views · Published 10 August 2018 · 14:57 · Indexed 23 September 2026
Channel: Anjali Luthra · 2018 · Education
This video explains how to solve / simplify Boolean expression using K Map. It’s very important for students of B.Tech / B.C.A. / B.Sc. computer science as well as for Class 12 Computer Science students. K map is very essential part of Boolean Algebra. Simplify Boolean expressions using K Map is an essential topic of Digital Electronics and Computer Architecture and Organisation. K map is always of size 2^n where n is the number of variables used in the Boolean expression. K map used in this video is for 3 variables and upcoming video will simplify Boolean expressions using 4 variable Kampala
More from this channel
-
17:50
Important Output Questions Class 12 Computer Science -3, Score 70/70
-
8:07
Important Questions for Class 12 IP Board Exam, Part 1, Java Basics
-
29:49
Question paper 2015 java part solved, Important Questions for class 12 IP
-
9:21
Complete lectures for Computer Science Class 12 CBSE Board
-
19:25
Python Tutorial for Begineers, Lecture 4 - Using conditions - if and if..else statement
-
3:02
BCA Entrance Exam is done!!! WHAT TO DO NEXT. A windy day in Melbourne.....
-
10:50
Practical File / Report File for Informatics Practices IP Class 11 & 12 CBSE
-
11:06
Calculating address of an element in a Column Major Matrix, 12 CS