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

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

Odd parity of a word can be conveniently tested by.

• OR gate A
• XOR gate B
• NOR gate C
• NAND gate D

According to Idempotent law , x + y = __________

• 1 A
• 0 B
• x C
• x . x D

Boolean algebra is also known as.

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

• 0 A
• 1 B
• x C
• 
  D

Boolean algebra use which of the following to represent arithmetic quantities.

• decimal digits A
• exponents B
• binary bits C
• fractions D

Logical multiplication refers to operation of.

• OR gate A
• AND gate B
• NOT gate C
• inverter gater D

Logical addition refers to operation of

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

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

The logic device that perform Boolean multiplication is.

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

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

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

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

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

Which of the following gate is two level logic gate.

• OR gate A
• AND gate B
• EXCLUSIVE OR gate C
• NAND 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

• x + y A
• 
  B
• 
  C
• 
  D