Top 550+ Solved Digital Principles and System Design MCQ Questions Answer
Q. Product-of-Sums expressions can be implemented using
a. 2-level or-and logic circuits
b. 2-level nor logic circuits
c. 2-level xor logic circuits
d. both 2-level or-and and nor logic circuits
Q. Each group of adjacent Minterms (group size in powers of twos) corresponds to a possible product term of the given
a. function
b. value
c. set
d. word
Q. Don’t care conditions can be used for simplifying Boolean expressions in
a. registers
b. terms
c. k-maps
d. latches
Q. It should be kept in mind that don’t care terms should be used along with the terms that are present in
a. minterms
b. expressions
c. k-map
d. latches
Q. Using the transformation method you can realize any POS realization of OR-AND with only.
a. xor
b. nand
c. and
d. nor
Q. In case of XOR/XNOR simplification we have to look for the following
a. diagonal adjacencies
b. offset adjacencies
c. straight adjacencies
d. both diagonal and offset adjencies
Q. The code where all successive numbers differ from their preceding number by single bit is
a. alphanumeric code
b. bcd
c. excess 3
d. gray
Q. How many two-input AND and OR gates are required to realize Y = CD+EF+G?
a. 2, 2
b. 2, 3
c. 3, 3
d. 3, 2
Q. A full adder logic circuit will have
a. two inputs and one output
b. three inputs and three outputs
c. two inputs and two outputs
d. three inputs and two outputs
Q. How many two input AND gates and two input OR gates are required to realize Y = BD + CE + AB?
a. 3, 2
b. 4, 2
c. 1, 1
d. 2, 3
Q. Which of following are known as universal gates?
a. nand & nor
b. and & or
c. xor & or
d. ex-nor & xor