There are occasions when it does not matter if the function produces 0 or 1 for a given minterm. Minterms that may produce either 0 or 1 for the function are said to be
There are occasions when it does not matter if the function produces 0 or 1 for a given minterm. Minterms that may produce either 0 or 1 for the function are said to be
The correct option is C Don't care condition
There are occasions when it does not matter if the function produces 0 or
1 for a given minterm. Minterms that may produce either 0 or 1 for the function
are said to be don't care condition.
Don't care condition:-
In digital logic, a
don't-care term for a function is an input-sequence for which the function
output does not matter. An input that is known never to occur is a cannot happen
term.
Miniterm:-
A minterm is a Boolean expression resulting in
1 for the output of a single cell, and 0s for all other cells in a Karnaugh
map, or truth table. If a minterm has a single 1 and the remaining
cells as 0s, it would appear to cover a minimum area of 1s.
Don't cares in a Karnaugh map, or truth table, may be either 1s or 0s, as long as we don't care
what the output is for an input condition.
K-map:-
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.
There are occasions when it does not matter if the function produces 0 or 1 for a given minterm. Minterms that may produce either 0 or 1 for the function are said to be don't care condition.
Don't care condition:-
In digital logic, a don't-care term for a function is an input-sequence for which the function output does not matter. An input that is known never to occur is a cannot happen term.
Miniterm:-
A minterm is a Boolean expression resulting in 1 for the output of a single cell, and 0s for all other cells in a Karnaugh map, or truth table. If a minterm has a single 1 and the remaining cells as 0s, it would appear to cover a minimum area of 1s.
Don't cares in a Karnaugh map, or truth table, may be either 1s or 0s, as long as we don't care what the output is for an input condition.
K-map:-
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.
