I know how to minimize a Boolean function with X as outputs (using K-map).
I have encountered an exercise in which I am asked to write the Normal Disjunctive Canonical Form (NDCF)/ Sum of Products (SoP) but i have X as inputs.
Does it mean I will not take them into consideration when writing the minterms for where the functions has output high (1)?
A B C | Y 0 X 0 | 1 0 X 1 | 0 1 0 0 | 1 1 0 1 | 0 1 1 0 | 0 1 1 1 | 1 Will Y = A'C' + AB'C' + ABC ?
Also can this be done directly from the truth table, no need for a K-map unless we have to minimize?