IGCSE Computer Science - 2210 - Chapter 3
IGCSE Computer Science - 2210 - Chapter 3
SCIENCE
Theory of Computer Science – Logic Gates and Logic
Circuits
Outlines
■ Logic Gates
■ Truth Tables
■ Logic Circuits and Conversions
– Converting Expression to Circuit
– Converting Circuit to Expression
■ Logic Circuits in Real World
– NAND Gate
– DeMorgan’s Theorem
Logic Gates
■ Single input: A
■ Output: X
■ X is true when A is false
■ X is false when A is true
■ Expressed in Boolean algebra as:
Logic Gates – NAND gate
■ A truth table represents ALL possible input states and output states of a Logic gate or a
combination of logic gates in a table.
■ The number of states is equal to . Where is the number of input variables.
■ Header of the table contains variable names and logical operation performed on these
variables.
■ For example can be represented as:
A B C
0 0 0 1 0 0
0 0 1 0 0 0
. . . . . .
Logic Circuits and Conversions
Logic Circuits in Real World
■ NAND gate is fundamental building block, which can be used to create AND, OR and
NOT gates
■ AND gate can be created using two NAND gates
Use a switch board to construct “AND” and “OR” gates to glow a bulb.
Construct truth table and circuit diagram of an imaginary XNAND gate and check if it is
similar to some other extended gate.