Digital Principles and System Design MCQs | Page - 3

 each group of adjacent minterms (group size in powers of twos) corresponds to a possible product term of the given function.

 don’t care conditions can be used for simplifying boolean expressions in k-maps which helps in pairing with 1/0.

 it should be kept in mind that don’t care terms should be used along with the terms that are present in minterms as well as maxterms which reduces the complexity of the boolean expression.

 using the transformation method we can realize any pos realization of or-and with only nor.

 there are many situations in logic design in which simplification of logic expression is possible in terms of xor and xnor operations.

 in case of xor/xnor simplification we have to look for the following diagonal and offset adjacencies. xor gives output 1 when odd number of 1s are present in input while xnor gives output 1 when even number of 1s or all 0s are present in input.

 entries known as diagonal mapping. the diagonal mapping holds true when for any relation, there is a projection of product on the factor.

 the code where all successive numbers differ from their preceding number by single bit is gray code. it is an unweighted code. the most important characteristic of this code is that only a single bit change occurs when going from one code number to next. bcd code is one in which decimal digits are represented by a group of 4-bits each, whereas, in excess-3 code, the decimal numbers are incremented by 3 and then written in their bcd format.

 to realize y = cd + ef + g, two and gates are required and two or gates are required.

 in 01, 10 or 11 output is low if any of the i/p is high. so, the correct option will be 00.