K Maps | Solving Boolean Expression using K Maps | SOP and POS
3,327 views · Published 10 August 2018 · 14:57 · Indexed 16 October 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
-
1:19
20140523 101421
-
5:50
Inroduction to sql -3
-
19:21
Introduction to SQL - 6(Individual Row Functions)
-
18:16
Searching Arrays (Linear Search & Binary Search)
-
19:42
Introduction to Netbeans 2 (Java Data types and Variables)
-
12:26
Introduction to Netbeans 3 (Java Program Example)
-
13:20
How to sort an array using Selection Sort (Arrays in C)
-
6:01
Java Tutorial for Beginners (Using if else)