How many AND gates are required to realize Y = CD + EF + G ?

How many two-input AND and OR gates are required to realize Y = CD+EF+G?

A universal logic gate is one which can be used to generate any logic function. Which of the following is a universal logic gate?

A full adder logic circuit will have

The gates required to build a half adder are

The following switching functions are to be implemented using a decoder:
f1 = ∑m(1, 2, 4, 8, 10, 14) f2 = ∑m(2, 5, 9, 11) f3 = ∑m(2, 4, 5, 6, 7)
The minimum configuration of decoder will be

The NOR gate output will be high if the two inputs are

The output of a logic gate is 1 when all the input are at logic 0 as shown below:
The gate is either

The code where all successive numbers differ from their preceding number by single bit is

Which of following are known as universal gates?

How many two input AND gates and two input OR gates are required to realize Y = BD + CE + AB?