ECAT Computer Science Chapter 5 Boolean Algebra

Boolean algebra is also known as.

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

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

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

• 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

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

The heart of analog to digital converter (ADC) is

• comparator A
• pulse generator B
• voltage source C
• current source D

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

Boolean algebra is.

• used for arithmetical operation is ALU A
• an aid for binary conversion B
• useful for error detection and error correction C
• used to describe the behavior and structure of logic networks and as an aid in the design of logic system D

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

Odd parity of a word can be conveniently tested by.

• OR gate A
• XOR gate B
• NOR gate C
• NAND gate 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