Be patient just like a puzzle

Edit Answers
12345678910
Across
  1. 4. a process that is used to obtain an expression containing fewest possible terms(12).
  2. 5. sum of literals in which each input variable appears exactly once(7).
  3. 7. pictorial method used to minimize boolean expressions(11).
  4. 8. number of cells in 3 variable k-map(5).
  5. 10. a group of 8 adjacent cells containing 0's or 1's(5).
Down
  1. 1. a group of 1's or 0's whose all members are overlapped by other groups(9).
  2. 2. a group of 4 adjacent cells containing 0's or 1's(4).
  3. 3. a product term in boolean algebra in which each variable appears once(7).
  4. 6. the table used to represent boolean expression of a logic gate(10).
  5. 9. condition that allows us to replace the empty cell of a k-map(8).