# What is K-map and why it is used?

## What is K-map and why it is used?

A Karnaugh map (K-map) is a pictorial method used to minimize Boolean expressions without having to use Boolean algebra theorems and equation manipulations. A K-map can be thought of as a special version of a truth table . Using a K-map, expressions with two to four variables are easily minimized.

How does a K-map work?

So what is a Karnaugh map? A Karnaugh map provides a pictorial method of grouping together expressions with common factors and therefore eliminating unwanted variables. The Karnaugh map can also be described as a special arrangement of a truth table.

What are the types of K-map?

K-Maps for 2 to 5 Variables

• 2 Variable K-Map. The number of cells in 2 variable K-map is four, since the number of variables is two.
• 3 Variable K-Map. The number of cells in 3 variable K-map is eight, since the number of variables is three.
• 4 Variable K-Map.
• 5 Variable K-Map.

### What is D K-map?

We mainly use the “don’t care” cell to make a large group of cells. The cross(×) symbol is used to represent the “don’t care” cell in K-map. This cross symbol represents an invalid combination. The “don’t care” in excess-3 code are 0000, 0001, 0010, 1101, 1110, and 1111 because they are invalid combinations.

What is the advantage of K-map?

Advantages of K-Maps The K-map simplification technique is simpler and less error-prone compared to the method of solving the logical expressions using Boolean laws. It prevents the need to remember each and every Boolean algebraic theorem.

What are the properties of K-map?

The Karnaugh map, also known as a Veitch diagram (K-map or KV-map for short), is a tool to facilitate management of Boolean algebraic expressions. A Karnaugh map is unique in that only one variable changes value between squares, in other words, the rows and columns are ordered according to the principles of Gray code.

## What are minterms and maxterms with examples?

Example 1: Maxterm = A+B’ First, we will write the minterm: Maxterm = A+B’ Now, we will write 0 in place of complement variable B’. We will write 1 in place of non-complement variable A. The binary number of the maxterm A+B’ is 10.

What is a 2 variable K-map?

2 variable K-maps The possible min terms with 2 variables (A and B) are A.B, A. B’, A’. B and A’. B’. The conjunctions of the variables (A, B) and (A’, B) are represented in the cells of the top row and (A, B’) and (A’, B’) in cells of the bottom row.

How do I get a K-map number?

A K-map is a square or rectangle divided into a number of smaller squares called cells. Each cell on the K-Map corresponds directly to a line in a truth table. There are always 2 Superscript n cells in a K-Map where is the number of variables in the function.

### What is Quad and octet?

Quad is a group of 4 one’s that horizantaally or vertically adjacent. End to end or in form of a square. A Quad eliminates two variables and their compliments. Octete eliminates the three variables and their compliments.

What is minterm and maxterms?

A minterm is the product of N distinct literals where each literal occurs exactly once. • A maxterm is the sum of N distinct literals where each literal occurs exactly once. Product-of-Sums Expressions. Standard Forms.