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

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

• decimal digits A
• exponents B
• binary bits C
• fractions 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

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

The number of inputs to full adder are

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

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

According to absorption law x. (x+y) =

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

Odd parity of a word can be conveniently tested by.

• OR gate A
• XOR gate B
• NOR gate C
• NAND gate 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 heart of analog to digital converter (ADC) is

• comparator A
• pulse generator B
• voltage source C
• current source 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

Which of the following gate is two level logic gate.

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

Pick up wrong logical expression

• 
  A
• 
  B
• 
  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

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