ECAT Pre Computer Science MCQ Test For Computer Chapter 5 With Answer

The number of inputs to full adder are

• 1 A
• 2 B
• 3 C
• 4 D

Which of the following statement is true in the case of AND gate with input A and B.

• If A and B are applied, there will not be any output A
• If neither input is applied, there will be an output B
• If one input is applied there will not be any output C
• If one input is applied there will be an output D

Which of the following function is referred as the complementary.?

• OR function A
• NOT function B
• NAND function C
• AND function D

The output will be one in case any input is one in the case of.

• OR gate A
• AND gate B
• NAND gate C
• NOT gate D

Which of the following operations are used by Boolean algebra.?

• Boolean addition A
• Boolean multiplication B
• Boolean complementation C
• All of the above D

An AND gate will function as OR if.

• all the inputs to the gates are "I" A
• all the inputs are "O" B
• a Not gate is added to it C
• all the inputs and outputs are complemented D

Pick up wrong logical expression

• 
  A
• 
  B
• 
  C
• 
  D

NAND gates are preferred over others because these.

• have lower fabrication area A
• can be used to make any gate B
• consume least elctronic power C
• provide maximum density in a chip D

Logical addition refers to operation of

• OR gate A
• AND gate B
• NOT gate C
• invertr gate D

The 'Boolean Algebra' is based on the premise that

• there are two states A
• differential equations can be solved by analog circuits. B
• either a statement is true or false C
• arithmetic operations can be carried out D

The logic device that perform Boolean multiplication is.

• AND gate A
• OR gate B
• Inverter C
• None of these D

The commutative law in Boolean Algebra, where a, b and c are binary number is.

• a+0=a A
• a+1=1 B
• a+b=b+a C
• a. (b+c) = a.b +a.c. D

If A and B are two 1-bit numbers, what logic gates will be required to test for A=B?

• NOR gate A
• EXCLUSIVE OR gate B
• EXCLUSIVE NOT gate C
• OR gate D

• x . y A
• x + y B
• x . y C
• x . y D

Boolean algebra is also known as.

• logical algebra A
• control algebra B
• switching algebra C
• programming algebra D