4.6.5.1 Using Boolean algebra Quiz: AQA Computer Science, Unit 6

The 20 questions

1. Which identity states that A AND 1 = A?

   • The absorption law
   • The idempotent law for OR
   • The identity law for AND
   • De Morgan's first law

2. What does De Morgan's law say about NOT(A AND B)?

   • It is equivalent to NOT A AND NOT B
   • It is equivalent to A OR B
   • It is equivalent to NOT A OR NOT B
   • It is equivalent to A XOR B

3. Which expression is equivalent to NOT(A OR B) according to De Morgan's laws?

   • NOT(A AND B)
   • NOT A OR NOT B
   • A AND B
   • NOT A AND NOT B

4. Simplify the Boolean expression A + A.B using the absorption law.

   • 1
   • A
   • A + B
   • A.B

5. Simplify A.(A + B) using Boolean algebra.

   • A.B
   • A + B
   • 0
   • A

6. Which Boolean identity states that A + NOT A equals 1?

   • The commutative law for OR
   • The complement law
   • The identity law for AND
   • The absorption law

7. Simplify the expression A.B + A.NOT B.

   • NOT A
   • A
   • B
   • A.B

8. Which expression is equivalent to NOT(NOT A AND B)?

   • A OR NOT B
   • NOT A OR B
   • NOT A AND NOT B
   • A AND NOT B

9. Using Boolean algebra, simplify (A AND B) OR (A AND NOT B) OR NOT A.

   • B
   • 1
   • A
   • NOT A

10. Simplify the expression A + (A.B) + (A.B.C).

    • A + B + C
    • A
    • A.B.C
    • A.B

11. Which statement about the idempotent law is correct?

    • A + A = 0 and A.A = 1
    • A + A = 2A and A.A = A^2 in every case
    • A + A = A and A.A = A
    • A + A = 1 and A.A = 0

12. A circuit produces the expression NOT(A + B) + A. Which simplified expression is equivalent?

    • NOT A + B
    • NOT B + A
    • A.NOT B
    • NOT A.NOT B

13. Simplify (A + B).(A + NOT B).

    • A + B
    • 1
    • B
    • A

14. Using De Morgan's law, which expression is the negation of A AND B AND C?

    • NOT A OR NOT B AND NOT C
    • NOT A OR NOT B OR NOT C
    • NOT A AND NOT B AND NOT C
    • A OR B OR C

15. A logic circuit implements NOT(A AND B). A designer wants to build the same function using only OR gates and NOT gates. Which expression should be used?

    • NOT A AND NOT B
    • NOT A OR NOT B
    • A OR B
    • A XOR B

16. Simplify the expression NOT(A.B) . NOT(A + B).

    • NOT A + NOT B
    • A XOR B
    • A . B
    • NOT A . NOT B

17. Which Boolean expression is equivalent to A XOR B written using only AND, OR and NOT?

    • (A AND B) OR (NOT A AND NOT B)
    • A AND B
    • (A OR B) AND (A OR B)
    • (A AND NOT B) OR (NOT A AND B)

18. Which expression is the simplified form of A.(B + C) + A.NOT B?

    • A + C
    • B + C
    • A.C
    • A

19. Which identity states that NOT(NOT A) = A?

    • De Morgan's first law, which states that NOT(A AND B) = NOT A OR NOT B
    • The absorption law, which states that A + A.B = A in every case
    • The double negation (involution) law
    • The idempotent law for AND, which states that A.A = A for any value of A

20. Simplify (A + 0).(A + 1) using Boolean identities.

    • A
    • A + 1
    • 1
    • 0

Related quizzes

• Data types Quiz · 4.1.1.1 · 20 questions
• Entity relationship modelling Quiz · 4.10.1.1 · 20 questions
• Big Data Quiz · 4.11.1.1 · 20 questions
• Function types and first-class objects Quiz · 4.12.1.1 · 20 questions
• Analysis Quiz · 4.13.1.1 · 20 questions
• Data structures and abstract data types Quiz · 4.2.1.1 · 20 questions
• Breadth-first and depth-first search Quiz · 4.3.1.1 · 20 questions
• Problem-solving and algorithms Quiz · 4.4.1.1 · 20 questions
• Natural, rational, irrational and real numbers Quiz · 4.5.1.1 · 20 questions
• Programming concepts: sequence, selection and iteration Quiz · 4.1.1.2 · 20 questions