Amazon Video

Minimization using K Map | Introduction to K-Map | Digital Electronics

The Karnaugh map or K-map is used for reduction or simplification of Boolean function either in Sum of Product( SOP) form or in Product of Sum( POS) kind.
A Karnaugh map or a K-map refers to a pictorial technique that is used to minimise various Boolean expressions without utilizing the Boolean algebra theorems in addition to the equation controls. A Karnaugh map can be an unique version of the reality table. We can easily reduce different expressions that have 2 to 4 variables making use of a K-map.

► Digital Logic

► Subscribe to our brand-new network:

Various other subject playlist Link:

► Design and Analysis of formulas (DAA):.

► Operating System:.

► Theory of Computation.

► Artificial Intelligence:.

► Computer Architecture:.

► Computer Networks:.

► Structured Query Language (SQL):.

► Discrete Mathematics:.

► Compiler Design:.

► Number System:.

► Cloud Computing & BIG Data:.

► Software Engineering:.

► Data Structure:.

► Graph Theory:.

► Programming in C:.

Our social networks Links:.
► Subscribe us on YouTube:
► Like our page on Facebook:
► Follow us on Instagram:
► Follow us on Telegram:
► For Any Query, Email us at:
► Be a Member & Give your Support on the listed below web link:

Leave a Reply

This site uses Akismet to reduce spam. Learn how your comment data is processed.