11

1 a b c d e 2 a

Logic gates and circuits

Below each answer there is a page reference for the coursebook. This is there to help you focus your revision. If you find that you get an answer wrong, you can use this guide to return to the coursebook to revise the areas that need some extra attention. Please note these are example answers only and do not represent the only possible answers. This truth table is for an OR gate. This truth table is for an AND gate. This truth table is for a NOR gate. This truth table is for a NAND gate. This truth table is for a NOT gate.
See Truth tables on page 276.

INPUT 1 0 0 1 1

INPUT 2 0 1 0 1

OUTPUT 0 0 0 1

See Truth tables on page 276. b

INPUT 1 0 0 1 1

INPUT 2 0 1 0 1

OUTPUT 1 0 0 0
See Combinatorial logic circuits with two inputs on page 277.

A NAND AND B C

OR

Cambridge IGCSE Computer Studies

Cambridge University Press 2011

Answers to Revision questions: 11 Logic gates & circuits

A OR B AND C NOT

See Designing simple logic circuits on page 279. 4 a

INPUT A 0 0 1 1

INPUT B 0 1 0 1

A AND B 0 0 0 1

NOT B 1 0 1 0

OUTPUT C 0 1 0 0

See Combinational logic circuits with two inputs on page 277. b

INPUT A 0 0 1 1

INPUT B 0 1 0 1

NOT A 1 1 0 0

NOT B 1 0 1 0

A AND (NOT B) 0 0 1 0

B AND (NOT A) 0 1 0 0

OUTPUT C 0 1 1 0

See Combinational logic circuits with two inputs on page 277. c

INPUT A 0 0 0 0 1 1 1 1

INPUT B 0 0 1 1 0 0 1 1

INPUT C 0 1 0 1 0 1 0 1

A AND C 0 0 0 0 0 1 0 1

B AND (NOT C) 0 0 1 0 0 0 1 0

OUTPUT D 0 0 1 0 0 1 1 1

See Combinational logic circuits with three inputs on page 278.

Cambridge IGCSE Computer Studies

Cambridge University Press 2011

Answers to Revision questions: 11 Logic gates & circuits