boolean logic diagrams

Boolean logic is used in computer science and electronics to make logical decisions using values that are either TRUE or FALSE (often represented as 1 or 0).

Logic gates are a visual way of representing a Boolean expression.

The AND gate returns TRUE only if both inputs are TRUE, otherwise it returns FALSE.

The OR gate returns TRUE if either input is TRUE, it returns FALSE only if both inputs are FALSE.

The NOT gate reverses the input value - NOT TRUE = FALSE, NOT FALSE = TRUE.

A truth table is a tool used to visualise the results of Boolean expressions by representing all possible inputs and associated outputs.

True. In the exam, any valid notation can be used in Boolean expression questions like T/F, 1/0, V for OR, etc.

Boolean operators are combined to produce more complex expressions called logic expressions, using brackets to clarify the order of operations.

A logic diagram is a visual representation of combinations of Boolean operators within a logic circuit.

A truth table is used to visualise the results of Boolean expressions by representing all possible inputs and associated outputs.

The expression Q = NOT(A OR B) means Q is the output of a NOT gate, which takes the output of an OR gate with inputs A and B.

True. In the exam, logic circuits will be limited to a maximum of 3 inputs and 1 output.

False. P = (A OR B) IF NOT C is NOT an example of combining Boolean operators. IF is not a valid Boolean operator

For a truth table with 3 inputs (A, B, C), 8 rows are needed (2^3 = 8).

Truth tables typically use 1 for TRUE and 0 for FALSE values.