# Examples of Boolean minimization

Status
Not open for further replies.

#### cahlucas

##### Newbie
Hello everyone,
In connection with the development of a program for Boolean minimization, think e.g. to Quine-McCluskey, I need examples and their correct solution so that I can check my program for correct operation. The number of variables may not exceed 20, and preferably between 4 and 10. The examples may be presented in this form (see the truth table below): X {A, B, C, D} = Σ {2,4,5,6,9,10,13,14}, with the solution: CD'+A'BC'+AC'D (C AND (NOT D) OR (NOT A) AND B AND (NOT C) OR A AND (NOT C) AND D). I would like to receive a response from you. Kind regards, Karel.
Code:
 i  A B C D  X
0  0 0 0 0  0
1  0 0 0 1  0
2  0 0 1 0  1
3  0 0 1 1  0
4  0 1 0 0  1
5  0 1 0 1  1
6  0 1 1 0  1
7  0 1 1 1  0
8  1 0 0 0  0
9  1 0 0 1  1
10  1 0 1 0  1
11  1 0 1 1  0
12  1 1 0 0  0
13  1 1 0 1  1
14  1 1 1 0  1
15  1 1 1 1  0

#### Carry for cents bazar

##### Member level 5
The tutorial is here. There are various ways to optimize your 1s and 0s.

Status
Not open for further replies.