Lesson 4.6.5.1
4.6.5.1 Using Boolean algebra Quiz: AQA Computer Science, Unit 6
20 questions
In partnership with Revision Ninja
Lesson 4.6.5.1, Using Boolean algebra: 20 multiple choice questions for the AQA Computer Science (7517), Unit 6: Fundamentals of computer systems, 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.
The 20 questions
-
Which Boolean algebra law states that A AND 1 = A?
- Null law
- Idempotent law
- Identity law
- Complement law
-
According to De Morgan's law, what is NOT(A AND B) equivalent to?
- NOT A AND NOT B
- A OR B
- NOT A OR NOT B
- A AND B
-
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
-
Simplify the Boolean expression A + A.B using the absorption law.
- 1
- A
- A + B
- A.B
-
Simplify A.(A + B) using Boolean algebra.
- A.B
- A + B
- 0
- A
-
Which Boolean algebra law states that A OR NOT A = 1?
- Commutative law
- Complement law
- Idempotent law
- Identity law
-
Simplify the expression A.B + A.NOT B.
- NOT A
- A
- B
- A.B
-
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
-
Using Boolean algebra, simplify (A AND B) OR (A AND NOT B) OR NOT A.
- B
- 1
- A
- NOT A
-
Simplify the expression A + (A.B) + (A.B.C).
- A + B + C
- A
- A.B.C
- A.B
-
Which Boolean equation correctly demonstrates the idempotent law?
- A OR NOT A = 1
- A AND 1 = A
- A OR A = A
- A OR 0 = A
-
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
-
Simplify (A + B).(A + NOT B).
- A + B
- 1
- B
- A
-
Which Boolean law states that NOT(A AND B) is equal to NOT A OR NOT B?
- Commutative law
- De Morgan's law
- Distributive law
- Absorption law
-
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
-
Simplify the expression NOT(A.B) . NOT(A + B).
- NOT A + NOT B
- A XOR B
- A . B
- NOT A . NOT B
-
Which Boolean operation is represented by the expression (A AND NOT B) OR (NOT A AND B)?
- XNOR
- NAND
- NOR
- XOR
-
Which expression is the simplified form of A.(B + C) + A.NOT B?
- A + C
- B + C
- A.C
- A
-
Which Boolean algebra law states that NOT(NOT A) = A?
- Complement law
- Identity law
- Double negation law
- Distributive law
-
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