Lesson 1.4.3a

1.4.3a Boolean problems, simplification and Karnaugh maps Quiz: OCR Computer Science, Unit 4

20 questions

In partnership with Revision Ninja

Lesson 1.4.3a, Boolean problems, simplification and Karnaugh maps: 20 multiple choice questions for the OCR Computer Science (H446), Unit 4: Data types, data structures and algorithms, written with Revision Ninja.

Host it live on the board and students join with a game code on their own devices, or revise alone with Free Play. The answers are revealed in the game.

Host this setFree Play

The 20 questions

  1. According to De Morgan's laws, what is NOT(A AND B) equivalent to?

    • A OR B
    • NOT A AND NOT B
    • NOT A OR NOT B
    • NOT(A OR B)
  2. Which Boolean law states that A AND (A OR B) simplifies to A?

    • Associative law
    • Absorption law
    • Commutative law
    • Distributive law
  3. What is the maximum number of cells in a group on a 4-variable Karnaugh map?

    • 8
    • 16
    • 12
    • 4
  4. According to De Morgan's laws, what expression is equivalent to NOT(A OR B)?

    • NOT(A AND B)
    • NOT A OR NOT B
    • A AND B
    • NOT A AND NOT B
  5. Which Boolean law allows terms to be reordered, such as A AND B equalling B AND A?

    • Commutative law
    • Associative law
    • Identity law
    • Distributive law
  6. In Boolean algebra, what is the simplified value of the expression A OR 1?

    • 1
    • NOT A
    • 0
    • A
  7. In Boolean algebra, what does the expression A OR NOT A simplify to?

    • 1
    • A
    • 0
    • 2
  8. In Boolean algebra, what is the simplified value of the expression A AND 0?

    • 1
    • 0
    • NOT A
    • A
  9. Using Boolean algebra rules, what does the expression A OR (A AND B) simplify to?

    • A AND B
    • A OR B
    • A
    • B
  10. What is the simplified equivalent of double negating a variable, written as NOT(NOT A)?

    • 0
    • 1
    • A
    • NOT A
  11. Grouping how many ones together in a Karnaugh map eliminates two variables?

    • 8
    • 2
    • 4
    • 16
  12. What is the simplified Boolean expression for (A AND B) OR (A AND NOT B)?

    • B
    • A AND B
    • A
    • NOT B
  13. Expanding A AND (B OR C) using the distributive law gives which expression?

    • A AND B AND C
    • (A OR B) AND (A OR C)
    • (A AND B) OR (A AND C)
    • (A AND B) AND C
  14. How many variables are eliminated when a group of 8 ones is formed on a K-map?

    • 2 variables
    • 1 variable
    • 3 variables
    • 4 variables
  15. What does the Boolean expression A OR (NOT A AND B) simplify to?

    • B
    • A
    • A AND B
    • A OR B
  16. How many total individual cells are present in a 4-variable Karnaugh map?

    • 4
    • 16
    • 32
    • 8
  17. What does the Boolean expression (A OR B) AND (A OR NOT B) simplify to?

    • A
    • B
    • A OR B
    • 0
  18. According to the identity law, what does the Boolean expression A AND 1 simplify to?

    • NOT A
    • 1
    • 0
    • A
  19. Which Boolean law allows regrouping of terms, such as (A OR B) OR C = A OR (B OR C)?

    • Absorption law
    • Distributive law
    • Associative law
    • Commutative law
  20. Which Boolean law states that the expression A AND A simplifies to A?

    • Idempotent law
    • Inverse law
    • Complement law
    • Redundancy law

All OCR Computer Science quizzes