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

Boolean algebra is also known as.

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

In Boolean algebra A.A.A.A.A

• 5A A
• A B
• A⁵ C
• 1 D

According to aborption law x+x.y=

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

Which of the following gate is two level logic gate.

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

The number of inputs to full adder are

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

Boolean description for the exclusive OR gate for two inputs x and y can be written as.

• x + y __ A
• _x _y B
• x. y + x. y C
• x . y + x .y D

The logic device that perform Boolean multiplication is.

• AND gate A
• OR gate B
• Inverter C
• None of these 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

• A + B + C + D A
• 
  B
• A BC D C
• A + B + C + D D

According to Boolean algebra x + 1 = ______________

• 0 A
• 1 B
• x C
• 
  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 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

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

Boolean expression for NOR gate with two inputs x and y can be written as.

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

In a three input NAND gate, if all the inputs are 1, the output is.

• 0 A
• 1 B
• 3 C
• indeterminate D