Q. Steps uesd in quine mckluskey method?

Step I:

Build a table in that every term of expression is represented in row (Expression must be in SOP form). Terms can be expressed in 0 (Complemented) or 1 (normal) form.

Step II:

Check all terms which differ in just one variable and then combine pairs by removing variable which differs in those terms. So a new table is formed. This process is repeated if necessary in new table also till all uncommon terms are left it implies that no matches left in table.

Step III:

a) Ultimately a two dimensional table is formed all terms that aren't removed in table form rows and all original terms form the column.

b) At every intersection of row and column where row term is subset of column term a 'X' is placed.

Step IV:

a) Put a square around every 'X' that is alone in column

b) Put a circle around every 'X' in any row that comprises a squared  'X'

c) If each column has a squared or circled 'X' then process is finished and respective minimal expression is formed by all row terms that have marked Xs.