- [A] 1000
- [B] 1101
- [C] 1101
- [D] 1001

**Answer:** Option [B]

Questions

1. Which of the following binary numbers is equivalent to decimal 13?

- [A] 1000
- [B] 1101
- [C] 1101
- [D] 1001

**Answer:** Option [B]

2. What is the octal equivalent of the binary number 10111101?

- [A] 675.
- [B] 275.
- [C] 572
- [D] 573

**Answer:** Option [B]

Advertisement

3. What is the output state of an OR gate if the inputs are 0 and 1?

- [A] 0
- [B] 1
- [C] not defined.
- [D] 2

**Answer:** Option [B]

4. An OR gate has _________.

- [A] two inputs and one output.
- [B] one input and one output.
- [C] one input and two outputs.
- [D] one input and three outputs.

**Answer:** Option [A]

5. The output of a _________ gate is only 1 when all of its inputs are 1.

- [A] NOR
- [B] XOR
- [C] AND
- [D] NOT

**Answer:** Option [C]

6. A NAND gate is equivalent to an AND gate plus a __________ gate put together.

- [A] NOR
- [B] NOT
- [C] XOR
- [D] XNOR

**Answer:** Option [B]

7. An AND gate will function as OR if ___________.

- [A] all the inputs to the gates are 1.
- [B] all the inputs are 0.
- [C] either of the inputs is 1.
- [D] all the inputs and outputs are complemented.

**Answer:** Option [D]

8. By adding inverters to the inputs and output of a AND gate we can obtain ______.

- [A] OR
- [B] AND
- [C] NOT
- [D] X-OR .

**Answer:** Option [D]

9. Boolean Algebra obeys _________.

- [A] commutative law.
- [B] associative law.
- [C] distributive law.
- [D] commutative, associative, distributive law.

**Answer:** Option [D]

10. A+(B.C) =?

- [A] A.B+C
- [B] A.B+A.C
- [C] A
- [D] (A+B).(A+C)

**Answer:** Option [D]

11. In which function each term known as min term.

- [A] SOP
- [B] POS
- [C] Hybrid
- [D] Both SOP and POS

**Answer:** Option [A]

12. In which function each term known as max term.

- [A] SOP
- [B] POS
- [C] Hybrid
- [D] Both SOP and Hybrid.

**Answer:** Option [B]

Advertisement