K-MAPS
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.
The first part of k-maps was easy, it was just understanding the k-map diagram and putting 1’s where needed in the diagram and grouping them, the confusing part was determining the equation or truth table using the grouping. First, I got really confused, but when it was explained the second time, I got it and now I think k-maps are really easy to determine if I have a Boolean expression and vice versa.