AQA - Section 4 - Boolean Expressions

What does the NOT gate do to its input?

• Requires both inputs to be true

• Combines two inputs

• Reverses the input

• Requires at least one true input

For an AND gate to output true, what is required of its inputs?

• Only one input is true

• At least one input is true

• Both inputs are true

• Both inputs are false

What symbol represents the OR gate in text-based Boolean algebra notation?

• A plus symbol

• A plus symbol with a circle around it

• A dot

• A slash

In Boolean algebra, how is the NOT operation represented in text format?

• A dot

• A plus symbol

• A slash or bar above the section

• A circle around the symbol

What is the correct Boolean expression for a circuit with an OR gate receiving inputs from an AND gate and a NOT gate?

• D = A OR B AND C

• D = NOT A AND B OR C

• D = A AND B OR NOT C

• D = A AND B OR C

Which gate requires only one input to be true while the other must be false for the output to be true?

• XOR gate

• AND gate

• NOT gate

• OR gate

How can the XOR gate be represented in text-based Boolean algebra?

• A dot

• A slash or bar

• A plus symbol with a circle around it

• A plus symbol

What is the correct Boolean expression for a circuit with an OR gate leading into an AND gate, which then leads into a NOT gate?

• D = NOT C AND (A OR B)

• D = (A OR B) AND NOT C

• D = NOT (A OR B) AND C

• D = A AND B OR NOT C

Is it possible to have more than one correct way to write a Boolean expression for a given logic circuit?

• No, unless NOT gates are involved

• Yes, but only if using XOR gates

• No, there is always only one correct form

• Yes, similar to math expressions