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

Odd parity of a word can be conveniently tested by.

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

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

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

The circuit that is used for parallel to serial conversion is

• decoder A
• encoder B
• multiplexer C
• demultiplexer D

• 0 A
• 1 B
• x C
• 
  D

The logic device that perform Boolean multiplication is.

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

The number of inputs to full adder are

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

According to Boolean algebra x + 1 = ______________

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

Boolean algebra is also known as.

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

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

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

According to aborption law x+x.y=

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

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

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