Digital Electronics Unit :1 Test

Questions for BCA Students (Total Marks: 50)

Section A: Multiple Choice (30 Marks, 1 marks each)

Instructions: Choose the best answer for each question.
1. Which of the following gates is known as the universal gate?

a) AND gate b) OR gate c) NAND gate d) XOR gate

2. What is the output of an OR gate when both inputs are 1?

a) 0 b) 1 c) Cannot be determined d) Error

3. Which theorem is NOT included in De Morgan’s laws?

a) Complementation b) Distribution c) Absorption d) Equivalence

4. What is the result of applying De Morgan’s theorem to the expression ¬(A + B)?

a) ¬A + ¬B b) ¬A • ¬B c) ¬A + B d) ¬A • B

5. The Boolean expression XYZ + X'YZ' simplifies to:

a) XZ b) XY + Z c) XY + XZ d) XYZ

6. Which circuit designing technique is used to minimize the number of gates required to
implement a Boolean expression?

a) SOP b) POS c) K-Map d) Minterm and Maxterm

7. In a Karnaugh map, what is a 'group'?

a) A set of adjacent 1's b) A set of adjacent 0's

c) A set of adjacent cells d) A set of non-adjacent cells

8. Which of the following is NOT a property of Boolean laws?

a) Idempotent Law b) Involution Law c) Absorption Law d) Exclusion Law

9. What is the binary equivalent of the decimal number 13?

a) 1001 b) 1010 c) 1101 d) 1110

10. How many minterms are there for a three-variable Boolean function?

a) 4 b) 6 c) 8 d) 10

11. What is the output of an AND gate when both inputs are 0?

a) 0 b) 1 c) Cannot be determined d) Error

12. Which of the following is a universal gate and can be used to implement any other gate?

a) NOR gate b) NAND gate c) XOR gate d) AND gate

13. How many Boolean variables can be combined in a single minterm?

a) One b) Two c) Three d) Four

14. Which of the following expressions is equivalent to (A + B)(A' + B')?

a) A'B' + AB b) AB + A'B' c) A'B' + AB' d) A'B + AB'

15. Which of the following is the complement of the expression XYZ?

a) ¬X¬Y¬Z b) ¬X + ¬Y + ¬Z c) ¬X + ¬Y + Z d) ¬X + Y + ¬Z

16. How many rows are there in a truth table for a Boolean function with four variables?

a) 4 b) 8 c) 16 d) 32

17. Which gate can be represented by the Boolean expression A ⊕ B?

a) OR gate b) AND gate c) XOR gate d) NAND gate

18. In a Karnaugh map, a group of 2 adjacent cells corresponds to how many variables changing
in the Boolean expression?

a) 0 b) 1 c) 2 d) 3

19. Which Boolean law states that A + AB = A?

a) Absorption Law b) Identity Law c) Complement Law d) Involution Law

20. Which of the following circuits can be implemented using only NOR gates?

a) Half Adder b) Full Adder c) Multiplexer d) Demultiplexer

21. Which of the following is a correct expression of De Morgan's Law?

a) ¬(A + B) = ¬A + ¬B b) ¬(A • B) = ¬A • ¬B

c) ¬(A + B) = ¬A • ¬B d) ¬(A • B) = ¬A + ¬B

22. What is the output of a NOR gate when both inputs are 1?

a) 0 b) 1 c) Cannot be determined d) Error

23. Which circuit designing technique is used to obtain the sum of products form?

a) SOP b) POS c) K-Map d) Minterm and Maxterm

24. How many terms are there in a maxterm for a three-variable Boolean function?

a) 4 b) 6 c) 8 d) 10

25. Which of the following is an equivalent expression to A ⊕ B?

a) (A + B) • (¬A + ¬B) b) (A • B) + (¬A • ¬B)

c) (A + B) • (A' + B') d) (A • B) • (¬A + ¬B)

26. In a Karnaugh map, what is a 'don't care' condition?

a) A condition where the output is always 1 b) A condition where the output is always 0

c) A condition where the output is ignored d) A condition where the output is uncertain

27. Which gate can be represented by the Boolean expression A • ¬B?

a) OR gate b) AND gate c) XOR gate d) NAND gate

28. What is the simplified form of the expression A'B' + AB + AB'?

a) A + B b) A • B c) A ⊕ B d) A' + B'

29. Which of the following expressions represents the sum of minterms for a Boolean function?

a) Σ(A, B, C) b) ∑(A, B, C) c) Π(A, B, C) d) ∏(A, B, C)

30. Which gate is equivalent to a NAND gate followed by an inverter?

a) NOR gate b) AND gate c) OR gate d) XOR gate

Section B: True/False (20 Marks, 1 mark each)
Instructions: Write 'T' if the statement is true and 'F' if the statement is false.
01. An XOR gate produces a HIGH output only when one input is HIGH and the other is LOW.

02. De Morgan's Law can be used to simplify complex Boolean expressions. ( )

03. A K-Map can efficiently identify groups of minterms for simplification. ( )

04. A logic circuit with only NAND gates can implement any other logic function. ( )

05. A combinational circuit's output depends only on its current inputs. ( )

06. A sequential circuit can store information based on its previous state. ( )

07. A full adder is a combinational circuit that can perform addition of two binary digits. ( )

08. A decoder circuit can be used to convert a binary code to its decimal equivalent. ( )

09. A multiplexer allows for the parallel transmission of multiple data lines. ( )

10. A flip-flop can be triggered by a clock signal to change its state.

11. Minterms are used in the process of simplifying Boolean expressions using Karnaugh
maps.

12. In Boolean algebra, the identity element for the AND operation is 1, and for the OR
operation is 0.

13. In a Karnaugh map, adjacent cells represent terms that differ in only one variable.

14. De Morgan’s laws describe the relationship between logical negation and conjunction
(AND) or disjunction (OR).

15. An XOR gate is equivalent to an OR gate followed by a NAND gate.

16. The complement of the sum of two variables is equal to the product of their complements.

17. XOR gate is associative but not commutative.

18. A SOP (Sum of Products) expression cannot be simplified further if all minterms are
included.

19. De Morgan's laws can only be applied to two variables at a time.

20. In Boolean algebra, the expression A + A'B simplifies to A.