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

An OR gate has 6 input. The number of input words in its truth table are.

• 6 A
• 32 B
• 64 C
• 128 D

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

According to Idempotent law , x + y = __________

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

Logical addition refers to operation of

• OR gate A
• AND gate B
• NOT gate C
• invertr gate 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

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

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

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

Boolean algebra is also known as.

• logical algebra A
• control algebra B
• switching algebra C
• programming algebra 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

The number of inputs to full adder are

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

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

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