Explain the truth table for an OR gate.

• A | B | Output, 1 | 0 | 1, 0 | 1 | 0, 1 | 1 | 0, 1 | 1 | 1

• A | B | Output, 1 | 0 | 0, 0 | 1 | 0, 1 | 0 | 0, 1 | 1 | 0

• A | B | Output, 0 | 0 | 0, 0 | 1 | 1, 1 | 0 | 1, 1 | 1 | 1

• A | B | Output, 0 | 0 | 1, 0 | 1 | 0, 1 | 0 | 1, 1 | 1 | 0

Describe the working principle of an XOR gate.

• XOR gate is a gate that outputs 1 when both inputs are 0.

• XOR gate is a gate that outputs 0 when both inputs are 1.

• XOR gate is a digital logic gate that gives a high output (1) only when the number of true inputs is odd.

• XOR gate is a digital logic gate that gives a high output (1) only when the number of true inputs is even.

Differentiate between a half adder and a full adder.

• A half adder is used for subtraction, while a full adder is used for addition.

• A full adder adds two single-bit binary numbers.

• A half adder adds two single-bit binary numbers, while a full adder adds three single-bit binary numbers.

• A half adder adds three single-bit binary numbers.

What is the boolean operation performed by an OR gate?

• 1. Equivalent of addition

• 1. Equivalent of multiplication

• 1. Equivalent of dificsin

• Equivalent of subtraction

What is the one’s complement for the binary number 011001

• 1. 000111

• 1. 100110

• 1. 111001

• 1. 110001

Which of the following gates can function on a single input?

• NOT

• AND

• OR

• NONE

What combination is a NAND gate?

• NOT AND

• 1. NOT OR

• 1. NOT NOT

• None of these

1. RTL stands for:

• Random transfer language

• Register transfer language

• Arithmetic transfer language

• All of these

1. Which operations are used for addition, subtraction, increment, decrement and complement function:

• Bus

• Memory transfer

• Arithmetic operation

• All of these

In which transfer the computer register are indicated in capital letters for depicting its function:

• Memory transfer

• Register Transfer

• Bus transfer

• None of these