Cambridge IGCSE and O Level Computer Science Second Edition

9 Databases

Find out more In this chapter, you will learn about:
★ the design and use of single table databases
Find five more uses
for databases, and for – fields
each one decide what – records
sort of information is – validation
being stored. ★ the use of basic data types
– text/alphanumeric
– character
– Boolean
– integer
– real
– date/time
★ the identification, purpose and use of primary keys
★ SQL scripts, used to query data stored in a single table database.

9.1 Databases

9.1.1 Single-table databases

A database is a structured collection of data that allows people to extract
information in a way that meets their needs. The data can include text, numbers,
pictures; anything that can be stored in a computer. Relational databases will be
studied at A Level but for IGCSE only single-table databases will be studied.
A single-table database contains only one table.

Why are databases useful?
Databases prevent problems occurring because:
» if any changes or additions are made it only has to be done once – data is

consistent
» the same data is used by everyone
» data is only stored once in relational databases which means no data duplication.

What are databases used for?
To store information about people, for instance:
» patients in a hospital
» pupils at a school.

To store information about things, for instance:
» cars to be sold
» books in a library.

To store information about events, for instance:
» hotel bookings
» results of races.

339

9 Databases Fields and records – the building blocks for any database
Row Inside a database, data is stored in tables, which consists of many records. Each
record consists of several fields. The number of records in a table will vary as
new records can be added and deleted from a table as required. The number of
fields in a table is fixed so each record contains the same number of fields.

An easy way to remember this is: each record is a row in the table and each field
is a column in the table.

Note: while databases can contain multiple tables, all the databases considered
in this chapter will contain a single table.

Table

Record 1 Field 1 Field 2 Field 3 Field 4

Record 2 Field 1 Field 2 Field 3 Field 4

Record 3 Field 1 Field 2 Field 3 Field 4

Record 4 Field 1 Field 2 Field 3 Field 4

Record 5 Field 1 Field 2 Field 3 Field 4

Record 6 Field 1 Field 2 Field 3 Field 4

▲ Figure 9.1 Structure of a database table Column

A table contains data about one type of item or person or event, and will be
given a meaningful name, for example:
» a table of patients called PATIENT
» a table of books called BOOK
» a table of doctor’s appointments called APPOINTMENT.

Each record within a table contains data about a single item, person or event, for
example:
» Winnie Sing (a hospital patient)
» IGCSE Computer Science (a book)
» 15:45 on January 2020 (an appointment).

As every record contains the same number of fields, each field in a record
contains a specific piece of information about the single item, person or event
stored in that record. Each field will have a meaningful name to identify the data
stored in it, for example:
» For a hospital patient the fields could include:

– The patient’s first name field called FirstName
– The patient’s family name field called FamilyName
– The patient’s date of admission field called DateOfAdmission

340

9.1 Databases

– The name of the patient’s consultant field called Consultant
– The patient’s ward number field called WardNumber
– The patient’s bed number field called BedNumber, etc.
The PATIENT table structure could look like this:

PATIENT Table

Record 1 FirstName FamilyName DateOfAdmission Consultant WardNumber BedNumber
Record 2 FirstName BedNumber
Record 3 FirstName FamilyName DateOfAdmission Consultant WardNumber BedNumber
Record 4 FirstName BedNumber
Record 5 FirstName FamilyName DateOfAdmission Consultant WardNumber BedNumber
Record 6 FirstName BedNumber
FamilyName DateOfAdmission Consultant WardNumber

FamilyName DateOfAdmission Consultant WardNumber

FamilyName DateOfAdmission Consultant WardNumber

▲ Figure 9.2 Structure of the PATIENT table

» For the table called BOOK the fields could include:
– Title of the book called Title
– Author of the book called Author
– ISBN, etc.

Activity 9.1

State what fields would you expect to find in each record for the doctor’s
appointments and give each field a suitable name.

Note: Field names should be a single word, which should not contain any spaces,
for example: BedNumber

Link Validation
The role of validation was discussed in Section 7.5. It may be worth the reader
For more on revisiting this part of the book before continuing with this chapter.
validation see Some validation checks will be automatically provided by the database
Section 7.5. management software that is used to construct and maintain the database. Other
validation checks need to be set up by the database developer during the
construction of the database.
The practical use of a database management system is strongly recommended
for all students. Practical examples will be used throughout this chapter. The
database management software used is Microsoft Access 365 as Microsoft Access is
used by most schools with students studying IGCSE Computer Science.
For example, the DateOfAdmission field will automatically be checked by the
software to make sure that any data input is a valid date before it can be stored
in the PATIENT table.

341

9 Databases

▲ Figure 9.3 Automatic validation for entering DateOfAdmission in the PATIENT table

Invalid date However, the WardNumber field validation needs to be set up to allow only
automatically rejected values 1 to 10 to be entered. This task needs to be completed by the database
developer before the database is used.

Out of range ward
number rejected

▲ Figure 9.4 Validation rule for entering WardNumber in the PATIENT table

9.1.2 Basic data types Error message

There are six basic data types that you need to be able to use in a database:

» text/alphanumeric
» character
» Boolean
» integer
» real
» date/time.

342

9.1 Databases

What is a data type?
Each field will require a data type to be selected. A data type classifies how the
data is stored, displayed and the operations that can be performed on the stored
value. For example, a field with an integer data type is stored and displayed as a
whole number and the value stored can be used in calculations.

These database data types are specified in the syllabus. They are available to use
as Access data types, but the names Access uses may be different from the terms
in the syllabus.

Find out more Syllabus data type Description Access data type
text/alphanumeric A number of characters short text/long text
Using Access (or any character A single character short text with a field size of one
other suitable database Boolean One of two values: either True Yes/No
management software) or False, 1 or 0, Yes or No
find all the different integer Whole number number formatted as fixed with
date and time formats zero decimal places
that are available to real A decimal number number formatted as decimal
use. date/time Date and/or time Date/Time

Activity 9.2

Using Access (or any other suitable database management software), set up a single
table database to store the PATIENT records using the fields given previously:

FirstName, FamilyName, DateOfAdmission, Consultant, WardNumber,
BedNumber.

» Choose a suitable data type for each field.
» Include validation checks to make sure that the ward number has whole

number values from 1 to 10, and that the bed number has whole number values
from 1 to 8.

» Enter the following data in the PATIENT table:

Winnie Sing, 12/10/2022, Mr Smith, 6, 8

Steve Chow, 23/10/2022, Miss Abebe, 6, 3

Chin Wee, 30/10/2022, Mr Jones, 7, 1

Min Hoo, 1/11/2022, Mr Smith, 6, 1

Peter Patel, 12/11/2022, Mr Jones, 7, 8

Sue Sands, 19/11/2022, Miss Abebe, 6, 2

Farouk Khan, 22/11/2022, Mr Jones, 7, 4

Ahmad Teo 22/11/2022, Mr Jones, 7, 2

You may want to look at the instructions on how to set up the CubScout database
later in this chapter if you have not set up a database before.

9.1.3 Primary keys

As each record within a table contains data about a single item, person, or event,
it is important to be able to uniquely identify this item. In order to reliably
identify an item from the data stored about it in a record there needs to be a
field that uniquely identifies the item. This field is called the primary key.

343

9 Databases A field that is a primary key must contain data values that are never repeated in
the table.
344 The primary key can be a field that is already used, provided it is unique, for
example the ISBN in the book table. The PATIENT table would need an extra field
for each record as all of the existing fields could contain repeated data. To create
a primary key, we could add a new field to each record, for example a unique
number could be added to each patient’s record. The extra field is:
» Primary key field called HospitalNumber

Activity 9.3

Using Access (or any other suitable database management software), add the
HospitalNumber field to the single table database PATIENT.

» Choose ‘text’ as the data type for this field.
» Include validation checks to ensure that 8 characters must be entered starting

with HN followed by 6 digits for example HN123456.

» Choose suitable data to store in each primary key field for the 6 patients in the

table.

Activity 9.4

1 Write down four database data types. Describe each data type and give an
example of a field where it would be a suitable choice.

2 Choose suitable words/phrases from the following list to correctly complete
the paragraph that follows:

Word list: database fields records

record table primary key

data type validation text

char Boolean field

You will need to use some words more than once.

A single ……………………….. …………………….. contains one ……………………. .

Each …………………….. consists of many …………………….. . Every ……………………..

has the same number of …………………….. . Every …………………….. is given a

…………………….. . Examples of data types are …………………….., ……………………..

and …………………….. . Some …………………….. will have …………………….. rules.

9.1.4 SQL

Structured Query Language (SQL) is the standard query language for writing
scripts to obtain useful information from a database. We will be using SQL
to obtain information from single-table databases. This will provide a basic
understanding of how to obtain and display only the information required from a
database. SQL is pronounced as es-queue-el.

9.1 Databases

For example, somebody needing to visit a patient would only require the ward
number and the bed number of that patient in order to find where they are in the
hospital. Whereas a consultant could need a list of the names of all the patients
that they care for.

SQL scripts
An SQL script is a list of SQL commands that perform a given task, often stored
in a file so the script can be reused.
In order to be able to understand SQL and identify the output from an SQL script,
you should have practical experience of writing SQL scripts. You can write scripts
using SQL commands in Access. There are many other applications that also allow
you to do this – MySQL and SQLite are freely available ones. When using any SQL
application, it is important that you check the commands available to use as
these may differ slightly from those listed in the syllabus and shown below.
You will need to be able to understand and identify the output from the
following SQL statements.

SQL Query Statement Description
SELECT
Fetches specified fields (columns) from a table; queries
FROM always begin with SELECT.
WHERE
Identifies the table to use.
ORDER BY
Includes only records (rows) in a query that match a given
SUM condition.

COUNT Sorts the results from a query by a given column either
alphabetically or numerically.

Returns the sum of all the values in a field (column). Used
with SELECT.

Counts the number of records (rows) where the field
(column) matches a specified condition. Used with SELECT.

An SQL command:

Starts with SELECT

FROM

To id entify th e fields : To specify the
to be displaye d : table to be used

Ends with ;

To show the end of
the command

Only the SELECT and FROM commands are mandatory in an SQL script. All other
commands are optional.
A SELECT statement takes the form:
SELECT Field1, Field2, Field3, etc. – this specifies the individual
fields (columns) to be shown.
SELECT * – this specifies that all fields (columns) are to be shown.

345

9 Databases A FROM statement takes the form:
FROM TableName – this specifies the table to use.
346 A WHERE statement takes the form:
WHERE Condition – this specifies the condition to apply.
Conditions often include values from fields, these values need to be stated in a
form that matches the data type for the field.

Field type Example value General notes Access notes
text 'Mr Smith' Double quotation marks can
Text field values should be in also be used.
character 'M' enclosed in single quotation
marks. Double quotation marks can
Boolean TRUE also be used.
integer 12 Character field values should
real 12.01 be in enclosed in single Data type is Yes/No
Date/time '22/11/2022' quotation marks. Allows integer or decimal
values.
Boolean can be TRUE or FALSE Allows integer or decimal
values.
Integer field values should be Date/time field values must
whole numbers. be in enclosed in hashes
(#).
Real field values should be
decimal numbers.

Date/time field values should
be in enclosed in single
quotation marks.

Conditions also require operators to compare values from fields.

Operator Description
= equal to
> greater than
< less than
>= greater than or equal to
<= less than equal to
<> not equal to
BETWEEN between a range of two values
LIKE search for a pattern
IN specify multiple values
AND specify multiple conditions that must all be true
OR specify multiple conditions where one or more conditions must be true
NOT specify a condition that must be false

An ORDER BY statement takes the form:
ORDER BY Field1, Field2, etc. – this specifies a sort in ascending or
alphabetical order starting with the first field.
ORDER BY Field1, Field2 DESC – this specifies a sort in descending or
reverse alphabetical order starting with the first field.

9.1 Databases

A SUM statement takes the form:
SELECT SUM (Field) – this specifies the field (column) for the calculation.
The field should be integer or real.
A COUNT statement takes the form:
SELECT COUNT (Field) – this specifies the field (column) to count if the
given criterium is met.

Example 1: Display consultant’s patients

For example, the following SQL command for the PATIENT single-table database
would provide a list of all Mr Smith’s patients showing the hospital number, first name
and family name for each of his patients.

SELECT HospitalNumber, FirstName, FamilyName
FROM PATIENT
WHERE Consultant = 'Mr Smith';
would display:

▲ Figure 9.5 Output from the PATIENT table showing Mr Smith’s patients

Example 2: Display consultant’s patients in
alphabetical order

This SQL command sorts the records in alphabetical order of family name:
SELECT HospitalNumber, FirstName, FamilyName
FROM PATIENT
WHERE Consultant = 'Mr Smith'
ORDER BY FamilyName;

would display:

▲ Figure 9.6 Output from the PATIENT table showing Mr Smith’s patients in
alphabetical order of family name

347

9 Databases

Activity 9.5

1 Using the single table database PATIENT you have created.
a Write an SQL query to list all Mr Jones’ patients.
b Write an SQL query to list all the patients not in ward 6.
c Write an SQL query to list all the patients who arrived on 12/11/2022.
d Write an SQL query to list all the patients who arrived between 12/10/2022
AND 30/10/2022.

2 Write down the output from this SQL query.

SELECT FirstName, FamilyName, BedNumber
FROM PATIENT
WHERE WardNumber = 7;

Activity 9.6

1 Using the single table database PATIENT you have created.
a Write an SQL query to count the number of patients in ward 7.
b Write an SQL query to count the number of patients not in ward 7.

2 Write down the output from this SQL query.

SELECT HospitalNumber, FirstName, FamilyName, Consultant
FROM PATIENT
ORDER BY Consultant, FamilyName;

Practical use of a database
As an IGCSE Computer Science student you need to be able to do the following:
» define a single-table database from given data storage requirements
» choose a suitable primary key for a database table
» read, complete and understand SQL scripts.

In order to do this, you will need to use a database management system. The
following case study shows how to set up a database with Microsoft Access 365
and complete the tasks described above.
Boys and girls between the ages of seven and eleven can join a cub scout group.
(http://en.wikipedia.org/wiki/Cub_Scout). Each cub scout group needs to keep
records about its members. Most groups will keep the following information
about each cub in their group:

348

9.1 Databases

▲ Figure 9.7 Enrolment form

Define a single-table database from given data storage requirements and
choose a suitable primary key
To create the cub scout database, open Access and select the Blank database
template.

▲ Figure 9.8 Blank database template

Then type the Filename CubScout and click the create button.

▲ Figure 9.9 Creating the CubScout database

349

9 Databases

Select the table design view... ....and name the table CUB.

▲ Figure 9.10 Design view ▲ Figure 9.11 Naming the table

Set up the fields to match the data collection form in Figure 9.7 and include an
extra field for a primary key.
Each field will require a meaningful name and a suitable data type must be selected.

Primary key

▲ Figure 9.12 Fields for the CUB table

Validation checks need to be built in for each field, for example the Gender
field.

Length check
Format check

Presence check

▲ Figure 9.13 Validation rules for Gender field
350

Link 9.1 Databases

For more on Activity 9.7
verification, see
Chapter 7. 1 a Set up a cub scout database including appropriate validation checks for
each field.

Enter data for at least 10 records.
b The cub scout leader wants to put each cub into a group called a ‘six’;

each ‘six’ can have up to six cubs in it and is given a name for example red,
yellow, blue and green.
Add a new text field called Six, and assign each cub to either a red, blue,
yellow or green six.
i Write an SQL query to pick out any cubs in the red six.
ii Write an SQL query to pick out any cubs in the red six or the blue six.
iii Write an SQL query to count the number of cubs in the red six.
c The cub scout leader wants to calculate the number of badges that all the
cubs have been awarded. Add a new integer field called Badges, enter the
number of badges awarded to each cub.
Write an SQL query to count the number of badges awarded to the whole
cub group.

Activity 9.8

1 A database of students is to be set up with the following fields:

» Family name
» Other names
» Student ID
» Date of Birth
» Date of Entry to School
» Current Class
» Current school year/grade
» Email address.

a Select a data type for each field.
b Which fields should be validated, and which fields should be verified?
c Decide the validation rules for those fields which should be validated.
d Which field would you choose for the primary key?
e Choose a suitable format for the student ID.
f Build a database with at least 10 records; include all your validation checks.

Ensure there are at least 3 different classes and 2 different years/grades.
g Set up and test SQL scripts to:

i Display Other names, Family and Email address in alphabetical order of
family name.

ii Select all the students from each class in alphabetical order.
iii Select all the students for each year/grade and print Other names,

Family name and Date of Birth, grouping the students by class.

351

9 Databases

Extension These are the data types used for attributes (fields)
in SQL.
For those students interested in studying Computer
Science at A Level, this is an extension of the use of Data Types Description
SQL to build and modify a database as well as using
SQL scripts to query an existing database. for Attributes
AS and A Level covers relational databases that
consist of more than one table. CHAR(n) Fixed length text n characters

Industry standard methods for building and VARCHAR(n) Variable length text maximum n characters
modifying a database BOOLEAN True or False SQL uses the integers 1 and 0
INTEGER Whole number
Database Management Systems (DBMSs) use a Data REAL Number with decimal places
Definition Language (DDL) to create, modify and DATE A date usually formatted as YYYY-MM-DD
remove the data structures that form a relational TIME A time usually formatted as HH:MM:SS
database. DDL statements are written as a script that
uses syntax similar to a computer program. Extension Activity
DBMSs also use a Data Manipulation Language (DML)
to add, modify, delete and retrieve the data stored in a Use SQL (DDL) commands to set up the
relational database. DML statements are written in a PATIENT database.
script that is similar to a computer program.
These languages have different functions: DDL This SQL script could have been used to create the
is used for working on the relational database Cub Scout database.
structure, whereas DML is used to work with the data
stored in the relational database. CREATE DATABASE CubScout
Most DBMSs use Structured Query Language (SQL) CREATE TABLE CUB(
for both data definition (DDL) and data manipulation
(DML). SQL was developed in the 1970s and since then CubName VARCHAR(30),
it has been adopted as an industry standard. DateOfBirth DATE,
We have already covered some SQL commands Address VARCHAR(40),
used to manipulate data. These are the SQL (DDL) Gender CHAR(1),
commands used to set up a database. School VARCHAR(30),
TelephoneNumber, CHAR(14)
SQL (DDL) Command Description DateJoined DATE);
CREATE DATABASE Creates a database ALTER TABLE CUB ADD PRIMARY KEY
CREATE TABLE Creates a table definition (CubNumber);
ALTER Table Alters a table definition
PRIMARY KEY Adds a primary key to a table

In this chapter, you have learnt about:
✔ define a single-table database from a given set of requirements
✔ suggest and use suitable data types for fields
✔ choose an appropriate primary key for a record
✔ understand SQL scripts used to query a single-table database.

352

9.1 Databases

Key terms used throughout this chapter
database – a persistent structured collection of data that allows people to extract
information in a way that meets their needs
single-table database – a database contains only one table
table – a collection of related records in a database
record – a collection of fields that describe one item
field – a database table
data type – a classification of how data is stored and displayed, and of which operations
that can be performed on the stored value
primary key – a field in a database that uniquely identifies a record
Structured Query Language (SQL) – the standard query language for writing scripts to
obtain useful information from a relational database.
SQL scripts – a list of SQL commands that perform a given task, often stored in a file so the
script can be reused
SELECT – an SQL command that fetches specified fields (columns) from a table
FROM – an SQL command that identifies the table to use
WHERE – an SQL command to include only those records (rows) in a query that match a
given condition
ORDER BY – an SQL command that sorts the results from a query by a given column either
alphabetically or numerically
SUM – an SQL command that returns the sum of all the values in a field (column);
used with SELECT
COUNT – an SQL command that counts the number of records (rows) in which the field
(column) matches a specified condition; used with SELECT

353

9 Databases Exam-style questions
Seat materials
and colours 1 A motor car manufacturer offers various combinations of: Paint
» seat colours colours
354 » seat materials
» car paint colours.

A table, CAR, was set up as single-table database to help customers
choose which seat and paint combinations were possible. (NOTE: N = no,
not a possible combination, Y = yes, combination is possible)

Code Cloth Leather Seat White Red Black Blue Green Silver Grey
colour

CB Y N black Y Y Y Y Y Y Y

LB N Y black N Y N N N Y Y

CC Y N cream N Y Y Y N N N

LC N Y cream N Y Y Y N N Y

CG Y N grey N Y Y Y Y Y N

LG N Y grey N Y N Y N Y Y

CR Y N red Y N Y N N Y Y

LR N Y red Y N Y N N Y Y

CB Y N blue N N N Y N N N

LB N Y blue N N Y Y Y NN

a i State the number of records shown in the table. [1]
ii State the number of fields shown in the table. [1]
iii State, with a reason, if any of the fields are suitable to use [2]
as primary key.

b The following SQL command was used:

SELECT Code

FROM CAR

WHERE SeatColour = 'Red' AND ('White' OR
'silver');

Show what will be displayed. [2]
c A customer wanted to know all the possible combinations for a [2]

car with leather seats and either silver or grey paint colour.
Complete the SQL command required.

SELECT *
FROM …………………………………
WHERE ……………… leather AND (silver ……………… grey);



2 A company that sells bicycles keeps records of the items in stock in
a table, CYCLE, using a single-table database. For each model of
bicycle, the following data is kept:
– model number, for example: BY00007
– description of model, for example: lady’s shopper
– colour of frame, for example: gold and black

Exam-style questions

– size of wheels, for example: 700 mm
– price of model in $, for example: $309.50
– still being manufactured: Yes or No
– number in stock.
a i S tate, with a reason for your choice, the data type you would
choose for each field in the table. [7]
ii I dentify, with a reason for each, the validation required for
each of these fields:
– model number
– price
– number in stock. [3]
iii State, with a reason, the field that would be suitable to
use as primary key. [2]
b SQL commands are used to extract data from the table.
Explain, using examples from your table, how each of these
commands could be used:
– SELECT
– FROM
– WHERE
– SUM
– ORDER BY [10]

3 A database table, PERFORMANCE, is used to keep a record of the
performances at a local theatre.

Show Number Type Title Date Sold Out
SN091 Comedy An Evening at Home 01-Sep Yes
SN102 Drama Old Places 02-Oct No
SN113 Jazz Acoustic Evening 03-Nov No
SN124 Classical Mozart Evening 04-Dec Yes
SN021 Classical Bach Favourites 01-Feb Yes
SN032 Jazz 30 Years of Jazz 02-Mar Yes
SN043 Comedy Street Night 03-Apr No
SN054 Comedy Hoot 04-May No

a State the number of fields and records in the table.

Fields............................................................................................

Records ............................................................................................... [2]
b Give two validation checks that could be performed on the Show Number field.
Validation check 1...........................................................................

���������������������������������������������������������������������������������������������������

Validation check 2...........................................................................

��������������������������������������������������������������������������������������������������� [2]

Cambridge IGCSE Computer Science (0478) Paper 21 Q6 a), b), May/June 2018

355

10 Boolean logic

In this chapter, you will learn about:
★ the identification, definition, symbols and functions of the standard logic gates:

NOT, AND, OR, NAND, NOR and XOR
★ how to use logic gates to create logic circuits from:

– a given problem
– a logic expression
– a truth table
★ how to complete truth tables from:
– a given problem
– a logic expression
– a logic circuit
★ how to write a logic expression from:
– a given problem
– a logic circuit
– a truth table.

10.1 Standard logic gate symbols

Electronic circuits in computers, solid state drives and controlling devices
are made up of thousands of logic gates. Logic gates take binary inputs
and produce a binary output. Several logic gates combined together form a
logic circuit and these circuits are designed to carry out a specific function.
The checking of the output from a logic gate or logic circuit is done using a
truth table.
This chapter will consider the function and role of logic gates, logic
circuits and truth tables. Also a number of possible applications of logic
circuits will be considered. A reference to Boolean algebra will be made
throughout the chapter; but this is really outside the scope of this text book.
However, Boolean algebra will be seen on many logic gate websites and
is included here for completeness, since many students may prefer this
notation to logic statements.

356

10.1 Standard logic gate symbols

10.1.1 Logic gate symbols

Six different logic gates will be considered in this chapter:

NOT gate AND gate

OR gate NAND gate

NOR gate XOR gate

▲ Figure 10.1 Logic gate symbols

Truth tables
Truth tables are used to trace the output from a logic gate or logic circuit. The
NOT gate is the only logic gate with one input; the other five gates have two
inputs (see Figure 10.1).

Although each logic gate can only have one or two inputs, the number of
inputs to a logic circuit can be more than 2; for example, three inputs give a
possible 23 (=8) binary combinations. And for four inputs, the number of possible
binary combinations is 24 (=16). It is clear that the number of possible binary
combinations is a multiple of the number 2 in every case. The possible inputs in
a truth table can be summarised as shown in Table 10.1.

▼ Table 10.1 All possible inputs for truth tables with two, three and four inputs

Inputs Inputs Inputs

AB ABC ABCD
00 000 0000
01 001 0001
10 010 0010
11 011 0011
100 0100
101 0101
110 0110
111 0111
1000
1001
1010
1011
1100
1101
1110
1111

357

10 Boolean logic

As we can see, a truth table will also list the output for every possible
combination of inputs.

10.2 The function of the six logic gates

10.2.1 NOT gate

A Description: Truth table: How to write this:
▲ Figure 10.2 X ▼ Table 10.2
X = NOT A (logic notation)
The output, X, is 1 if: Input Output X = —A (Boolean algebra)

the input, A, is 0 A X
0 1
1 0

10.2.2 AND gate Note the use of Boolean algebra to
represent logic gates. This is optional at
IGCSE but many students may prefer to
use this notation (see NOTE later).

A Description: Truth table: How to write this:
B X ▼ Table 10.3

▲ Figure 10.3 Inputs Outputs

The output, X, is 1 if: AB X X = A AND B (logic notation)
both inputs, A and B, are 1 00 0 X = A . B (Boolean algebra)
01 0
10 0
11 1

10.2.3 OR gate

A Description: Truth table: How to write this:
B X ▼ Table 10.4
X = A OR B (logic notation)
▲ Figure 10.4 Inputs Output X = A + B (Boolean algebra)

The output, X, is 1 if: AB X
00 0
either input, A or B, or 01 1
both, are 1 10 1
11 1

358

10.2 The function of the six logic gates

10.2.4 NAND gate (NOT AND)

A X Description: Truth table: How to write this:
B ▼ Table 10.5
X = A NAND B (logic notation)
▲ Figure 10.5 X = A . B (Boolean algebra)

The output, X, is 1 if: Inputs Output

input A AND AB X
input B are NOT both 1 00 1
01 1
10 1
11 0

10.2.5 NOR gate (NOT OR)

A Description: Truth table: How to write this:
B X ▼ Table 10.6
X = A NOR B (logic notation)
▲ Figure 10.6 Inputs Output X = A + B (Boolean algebra)

The output, X, is 1 if: AB X
00 1
neither input A nor 01 0
input B is 1 10 0
11 0

10.2.6 XOR gate

A Description: Truth table: How to write this:
B
X ▼ Table 10.7 X = A XOR B (logic notation)
▲ Figure 10.7
The output, X, is 1 if: Inputs Output X = (A . B) + (A . B) (Boolean
algebra)
(input A is 1 AND input AB X
B is 0) 00 0 NOTE: this is sometimes written as:
01 1 (A + B) . (A . B)
or 10 1
11 0
(input A is 0 AND input
B is 1)

Activity 10.1

Show why X = (A AND NOT B) OR (NOT A AND B)
and
Y = (A OR B) AND (NOT (A AND B)) both represent the same logic gate.

359

10 Boolean logic

You will notice in the Boolean algebra, three new symbols; these have the
following meaning:
» . represents the AND operation
» + represents the OR operation
» a bar (above the letter or letters, e.g. a) represents the NOT operation.

10.3 Logic circuits, logic expressions, truth
tables and problem statements

When logic gates are combined together to carry out a particular function, such
as controlling a robot, they form a logic circuit. The following eight examples
show how to carry out the following tasks:
» Create a logic circuit from a:

– problem statement (examples 6 and 7)
– logic or Boolean expression (examples 3 and 8)
– truth table (examples 4 and 5)
» Complete a truth table from a:
– problem statement (examples 6 and 7)
– logic or Boolean expression (examples 3 and 8)
– logic circuit (example 1)
» Write a logic or Boolean expression from a:
– problem statement (examples 6 and 7)
– logic circuit (example 2)
– truth table (examples 4 and 5).

Example 1

Produce a truth table for the following logic circuit (note the use of black circles at the
junctions between wires):

A
BP

R

Q X
C

Part 1 Part 2 Part 3

▲ Figure 10.8
There are three inputs to this logic circuit, therefore, there will be eight possible
binary values that can be input.
To show stepwise how the truth table is produced, the logic circuit has been split up
into three parts, as shown by the dotted lines, and intermediate values are shown as
P, Q and R.

360

10.3 Logic circuits, logic expressions, truth tables and problem statements

A Part 1
B
P This is the first part of the logic circuit; the first task is to find the intermediate values
C P and Q.
▲ Figure 10.9
The value of P is found from the AND gate where the inputs are A and B. The value
of Q is found from the NOR gate where the inputs are B and C. An intermediate truth
table is produced using the logic function descriptions in Section 10.2.

Q ▼ Table 10.8 input values C Output values
0 PQ
A B 1 01
0 0 0 00
0 0 1 00
0 1 0 00
0 1 1 01
1 0 0 00
1 0 1 10
1 1 10
1 1

P R Part 2
Q
▲ Figure 10.10 The second part of the logic circuit has P and Q as inputs and the intermediate
output, R:
This produces the following intermediate truth table. (Note: even though there are
only two inputs to the logic gate, we have generated eight binary values in part 1 and
these must all be used in this second truth table).

▼ Table 10.9

Inputs Output
R
PQ 1
01 0
00 0
00 0
00 1
01 0
00 1
10 1
10

361

10 Boolean logic

R Part 3
C
▲ Figure 10.11 The final part of the logic circuit has R and C as inputs and the final
output, X:
X This gives the third intermediate truth table:

▼ Table 10.10

Inputs Output

RCX
101
011
000
011
101
011
101
110

Putting all three intermediate truth tables together produces the final truth table,
which represents the original logic circuit:

▼ Table 10.11

Input values Intermediate values Output

ABC PQR X
000 011 1
001 000 1
010 000 0
011 000 1
100 011 1
101 000 1
110 101 1
111 101 0

The intermediate values can be left out of the final truth table, but it is good practice
to leave them in until you become confident about producing the truth tables. The final
truth table would then look like this:

▼ Table 10.12

Input values Output

ABC X
000 1
001 1
010 0
011 1
100 1
101 1
110 1
111 0

362

10.3 Logic circuits, logic expressions, truth tables and problem statements

Example 2

Write logic expressions from the following logic circuits:

a A Logic gate 1

Logic gate 3
BX

C Logic gate 2

▲ Figure 10.12

The first action is to look at the gates connected to the inputs A, B and C:

logic gate 1: (A AND B)
logic gate 2: (B OR C)
We then join these together using logic gate 3:
[(A AND B)] XOR [(B OR C)] which gives us the required logic expression.

(Note: the square brackets “[ ]” in the expression are not necessary and are used here
just for clarity.)

This would be written as: (A AND B) XOR (B OR C)

b

A

Logic gate 1 Logic gate 3

B Logic gate 4

Logic gate 2 X
C
▲ Figure 10.13

363

10 Boolean logic

Again, we will do this in the order of logic gates 1 and 2 first (connected to the three
inputs):

logic gate 1: (A NAND C)

logic gate 2: (B AND C)

However, logic gate 3 is also connected to one of the inputs so that should be done next:

logic gate 3: (logic gate 1) NOR A

If we replace (logic gate 1) by the logic expression above, we get:

((A NAND C) NOR A)

Finally, we can join all these together using:

logic gate 4: ((A NAND C) NOR A) OR (B AND C)

Activity 10.2

1 Produce truth tables from the following logic circuits:

a A

X

B
▲ Figure 10.14

b A

X

B

▲ Figure 10.15

c A

B

X

C
▲ Figure 10.16
364

10.3 Logic circuits, logic expressions, truth tables and problem statements

d A

B

X

C

▲ Figure 10.17
e A

B

X

C
▲ Figure 10.18

2 Write logic expressions for the following logic circuits:
a A

BX

C
▲ Figure 10.19

365

10 Boolean logic

b

A

X

B
C
▲ Figure 10.20

Example 3

A logic circuit can be represented by the following logic expression: (A XOR C) OR
(NOT C NAND B)
Produce a logic circuit and a truth table from the above statement.

In this example we have a connecting logic gate which is OR.

So, if we produce one half of the circuit from (A XOR C) we get:

A

C
▲ Figure 10.21

The other half of the circuit is found from (NOT C NAND B):

B

C
▲ Figure 10.22

366

10.3 Logic circuits, logic expressions, truth tables and problem statements

If we now combine these together to form the final logic circuit:

A
Stage ‘P’

Output (X)

B Stage ‘R’

Stage ‘Q’
C

▲ Figure 10.23
The truth table is shown:
▼ Table 10.13

Input values C Values at stages: Output
0
AB 1 ‘P’ ‘Q’ ‘R’ X
00 0 011 1
00 1 101 1
01 0 010 0
01 1 101 1
10 0 111 1
10 1 001 1
11 110 1
11 001 1

Example 4

Look at the two truth tables below; in each case produce a logic expression and the
corresponding logic circuit:
a
▼ Table 10.14

Inputs Output To produce the logic statement, we only con-
cern ourselves with the truth table row where
AB X the output value is 1. In this case, A = 1 and B =
00 0 0 which gives the logical expression:
01 0
10 1 A AND NOT B

11 0

So we have the logic beexpwreriststeionna: sAAA.N—BD NOT B It is now possible to draw the
(Note that this could in Boolean.)
corresponding logic circuit:

AX

B

▲ Figure 10.24

367

10 Boolean logic

b Output This time we have two rows where the output is 1;
this gives the following logical expressions:
▼ Table 10.15 X (NOT A AND B)
0 (A AND B)
Inputs 1 We now join these together using an OR gate to give:
AB 0
00 1 (NOT A AND B) OR (A AND B)
01
10
11

So we have the logic expression: (NOT A AND B) OR (A AND B)
(This could be written as: —A. B + A . B)
It is now possible to draw the corresponding logic circuit:

A

X

B
▲ Figure 10.25

Example 5

a Which Boolean expression is represented by the following truth table?
▼ Table 10.16

Input values Output

ABCX
0001
0010
0100
0110
1001
1010
1101
1110

We only need to consider those rows where the output is a 1. This gives us the
following three logic expressions:

(NOT A AND NOT B AND NOT C)
(A AND NOT B AND NOT C)
(A AND B AND NOT C)

If we now join the three expressions with an OR gate, we end up with the final
logic expression:

(NOT A AND NOT B AND NOT C) OR (A AND NOT B AND NOT C) OR
(A AND B AND NOT C)

368

10.3 Logic circuits, logic expressions, truth tables and problem statements

b i Which logic expression is represented by the following truth table?
ii Show that your logic expression in part i is the same as: (B AND C) OR (A AND
C) OR (A AND B)

▼ Table 10.17

ABCX
0000
0010
0100
0111
1000
1011
1101
1111

i We only need to consider those rows where the output is a 1. This gives us the
following four Boolean expressions:

(NOT A AND B AND C)
(A AND NOT B AND C)
(A AND B AND NOT C)
(A AND B AND C)

If we now join the four expressions with an OR gate we end up with the
following logic expression:

(NOT A AND B AND C) OR (A AND NOT B AND C) OR (A AND B AND NOT
C) OR (A AND B AND C)

ii To show that (B AND C) OR (A AND C) OR (A AND B) produces the same output
as that shown in part i we need to produce a new truth table and show that
the output is the same as the one in the given truth table:

▼ Table 10.18

A B C B AND C A AND C A AND B (B AND C) OR (A X

AND C) OR (A AND

B)

000000 0 0

001000 0 0

010000 0 0

011100 1 1

100000 0 0

101010 1 1

110001 1 1

111111 1 1

As the second truth table shows, the outputs from logic expressions are both the
same; thus the logic expression (B AND C) OR (A AND C) OR (A AND B) gives the
same output as the logic expression in part i.

369

10 Boolean logic Activity 10.3

370 1 Produce:
i a truth table
ii a logic circuit

from the following logic expression:

(NOT A AND B) AND (NOT B OR C)

2 Produce:
i a truth table
ii a logic circuit

from the following logic expression:

(A XOR B) OR ((B NOR C) AND B) ABX
001
3 Produce: 010
i a logic expression 100
ii a logic circuit 111

from the following truth table:

4 Write down a logic expression for each of the following truth tables:

a b

ABCX ABCX
0001 0000
0010 0011
0100 0101
0110 0110
1001 1001
1011 1011
1100 1100
1110 1110

5 a Write down a logic expression corresponding to the following truth table:

ABCX
0001
0011
0100
0110
1001
1011
1100
1110

b Show that the following logic expression produces the same output as your
answer to part a above:

(NOT A AND NOT B) OR (A AND NOT B)

10.3 Logic circuits, logic expressions, truth tables and problem statements

Example 6

A safety system uses three inputs to a logic circuit. An alarm, X, sounds if input A
represents ON and input B represents OFF; or if input B represents ON and input C
represents OFF.
Produce a logic circuit and truth table to show the conditions that cause the output X to be 1.
The first thing to do is to write down the logic statement representing the scenario
in this example. To do this, it is necessary to recall that ON = 1 and OFF = 0 and also
that 0 is usually considered to be NOT 1.
So we get the following logic expression:

(A AND NOT B)       OR       (B AND NOT C)

this equates to: the two parts are this equates to
A is ON and B is OFF connected by the OR gate B is ON AND C is OFF

Note: this expression can also be written as follows (Boolean expression):
(A . —B ) + (B . C—)

The logic circuit is made up of two parts as shown in the logic expression. We will produce
the logic gate for the first second part. Then join both parts together with the OR gate.

AB

BC

Part 1 Part 2
▲ Figure 10.26

Now combining both parts with the OR gate gives us:

A

Part 1

BX

Part 2

C

▲ Figure 10.27
In order to produce the truth table, there are two ways to do this:

» trace through the logic circuit using the method described in example 1 (Section 10.3)
» produce the truth table using the original logic expression; this second method

has the advantage that it allows you to check that your logic circuit is correct.

371

10 Boolean logic We will use the second method in this example:

372 ▼ Table 10.19

Inputs Intermediate values Output

AB C (A AND NOT B) (B AND NOT C) X
00 0 0 0 0
0
00 1 00 1
0
01 0 01 1
1
01 1 00 1
0
10 0 10

10 1 10

11 0 01

11 1 00

(Note: it is optional whether to leave in the intermediate values or simply remove them
giving a 4-column truth table with headings: A, B, C, X)

Example 7

A wind turbine has a safety system which uses three inputs to a logic circuit. A certain
combination of conditions results in an output, X, from the logic circuit being equal to 1.
When the value of X = 1 then the wind turbine is shut down.
The following table shows which parameters are being monitored and form the three
inputs to the logic circuit.
▼ Table 10.20

parameter parameter binary description of condition
description S value
turbine speed <= 1000 rpm
turbine speed 0 turbine speed > 1000 rpm
1 bearing temperature <= 80°C
bearing temperature T 0 bearing temperature > 80°C
1 wind velocity <= 120 kph
wind velocity W 0 wind velocity >120 kph
1

The output, X, will have a value of 1 if any of the following combination of conditions occur:

Either turbine speed <= 1000 rpm and bearing temperature > 80°C
Or turbine speed > 1000 rpm and wind velocity > 120 kph
Or bearing temperature <= 80°C and wind velocity > 120 kph

Design the logic circuit and complete the truth table to produce a value of X = 1 when
either of the three conditions above occur.
In this example, a real situation is given and it is necessary to convert the information
into a logic expression and then produce the logic circuit and truth table. It is
advisable in problems as complex as this to produce the logic circuit and truth table
separately (based on the conditions given) and then check them against each other to
see if there are any errors.

10.3 Logic circuits, logic expressions, truth tables and problem statements

Stage 1

The first thing to do is to convert each of the three statements into logic expressions.
Use the information given in the table and the three condition statements to find how
the three parameters S, T and W are linked. We usually look for the key words AND,
OR and NOT when converting actual statements into logic.
We end up with the following three logic expressions:
i turbine speed <= 1000 rpm and bearing temperature > 80°C
logic expression: (NOT S AND T)
ii turbine speed > 1000 rpm and wind velocity > 120 kph
logic expression: (S AND W)
iii bearing temperature <= 80°C and wind velocity > 120 kph
logic expression: (NOT T AND W)

Stage 2

This now produces three intermediate logic circuits:
i

S

T
▲ Figure 10.28

ii S

W
▲ Figure 10.29

iii

T

W
▲ Figure 10.30

Each of the three original statements were joined together by the word ‘OR’. Thus,
we need to join all of the three intermediate logic circuits by two OR gates to get the
final logic circuit.
We will start by joining i and ii together using an OR gate:

S

T

W
▲ Figure 10.31

373

10 Boolean logic

Finally, we connect the logic circuit in Figure 10.31 to Figure 10.30 to obtain the
answer:

S
T

X

W

▲ Figure 10.32
The final part is to produce the truth table. We will do this using the original logic
statement. This method has the bonus of allowing an extra check to be made on the
logic circuit in Figure 10.32 to see whether or not it is correct. It is possible, however,
to produce the truth table straight from the logic circuit in Figure 10.32.
There were three parts to the problem, so the truth table will first evaluate each part.
Then, by applying OR gates, as shown below, the final value, X, is obtained:
i (NOT S AND T)
ii (S AND W)
iii (NOT T AND W)
We find the outputs from parts (i) and (ii) and then OR these two outputs together to
obtain a new intermediate, which we will now label part (iv).
We then OR parts (iii) and (iv) together to get the value of X.

Inputs Intermediate values Output

S T W (i) (ii) (iii) (iv) X

(NOT S (S AND (NOT T
AND T) W) AND W)

0 0 0 0 0 0 00

0 0 1 0 0 1 01

0 1 0 1 0 0 11

0 1 1 1 0 0 11

1 0 0 0 0 0 00

1 0 1 0 1 1 11

1 1 0 0 0 0 00

1 1 1 0 1 0 11

374

10.3 Logic circuits, logic expressions, truth tables and problem statements

Example 8

Consider the logic statement:

((A NOR B) AND C) NAND (A OR NOT B)

a Draw a logic circuit to represent the given logic statement.
b Complete the truth table for the given logic statement.
▼ Table 10.21

Input values Working space Output
ABC X
000
001
010
011
100
101
110
111

First, we need to break down the logic statement. Assign:
i P = (A NOR B)
ii Q = (A OR NOT B)
iii R = (P AND C)
And then note that X = R NAND Q
Now draw the logic gates for statements i to iii and connect them together.

A

Output Q

B X

C Output P
▲ Figure 10.33
Output R

375

10 Boolean logic

We can then fill out the truth table in stages, starting with P, Q and then R, followed
finally by X:

Input Values Working Space Output
ABC X
000 P = (A NOR B) Q = (A OR R = (P AND C)
NOT B) 1

1 10

001 1 1 10

010 0 0 01

011 0 0 01

100 0 1 01

101 0 1 01

110 0 1 01

111 0 1 01

Find out more Activity 10.4

Boolean algebra 1 Draw the logic circuits and complete the truth tables for the following logic or
appears throughout Boolean expressions:
this chapter and is a X = (A OR B) OR (NOT A AND B)
the official method b Y = (NOT A AND NOT B) AND (NOT B OR C)
for depicting logic c T = 1 if (switch K is ON or switch L is ON) OR (switch K is ON and switch M
statements. Try using is OFF) OR (switch M is ON)
truth tables to prove d X = (A AND NOT B) OR (NOT B AND C)
the following pairs e R = 1 if (switch A is ON and switch B is ON) AND (switch B is ON or switch C
of Boolean (logic) is OFF)
statements are the
same: 2 Produce the logic circuit and complete a truth table to represent the following scenario.
i A + A(−A.B. B=) = A A chemical process is protected by a logic circuit. There are three inputs to the
ii A + A + B
iii (A + B) . (A + C) = logic circuit representing key parameters in the chemical process. An alarm,
A+B.C X, will give an output value of 1 depending on certain conditions in the chemical
AA−−++ BB−− process. The following table describes the process conditions being monitored:
iv (A.B) =
v A+B = Parameter description Parameter Binary value Description of condition
chemical reaction rate R 0 reaction rate < 40 mol/l/sec
1 reaction rate >= 40 mol/l/sec
process temperature T 0 temperature > 115°C
1 temperature <= 115°C
concentration of C 0 concentration <= 4 mol
chemicals 1 concentration > 4 mol

An alarm, X, will generate the value 1 if:

either reaction rate < 40 mol/l/sec
or concentration > 4 mol AND temperature > 115°C
or reaction rate >= 40 mol/l/sec AND temperature > 115°C

376

10.3 Logic circuits, logic expressions, truth tables and problem statements

3 Produce the logic circuit and complete a truth table to represent the following
scenario.

A power station has a safety system controlled by a logic circuit. Three inputs
to the logic circuit determine whether the output, S, is 1. When S = 1 the power
station shuts down.

The following table describes the conditions being monitored.

Parameter Parameter Binary value Description of condition
description G
gas temperature R 0 gas temperature <= 160°C
W 1 gas temperature > 160°C
reactor pressure 0 reactor pressure <= 10 bar
1 reactor pressure > 10 bar
water 0 water temperature <= 120°C
temperature 1 water temperature > 120°C

Output, S, will generate a value of 1, if:

either gas temperature > 160°C AND water temperature <= 120°C

or gas temperature <= 160°C AND reactor pressure > 10 bar

or water temperature > 120°C AND reactor pressure > 10 bar

4 A car’s engine management system uses three sensors A, B and C. The data from
these sensors forms the input to a logic circuit. When the output (X) from the
logic circuit is 1 a signal is sent to a warning light on the dash board of the car.

The following table describes the conditions being monitored.

Parameter Parameter Binary value Description of condition
description E
exhaust P 0 exhaust temperature > 400°C
temperature W 1 exhaust temperature <= 400°C
oil pressure 0 oil pressure <= 10 bar
1 oil pressure > 10 bar
water temperature 0 water temperature <= 110°C
1 water temperature > 110°C

Output, X, will generate a value of 1, if:
either exhaust temperature > 400°C AND oil pressure > 10 bar
or oil pressure <= 10 bar AND water temperature > 110 °C
or oil pressure > 10 bar AND water temperature > 110 °C
Produce:

i a truth table,
ii a logic expression and
iii a logic circuit
to represent the above scenario.
Also confirm that the output from your logic circuit matches the output from
your truth table in part i.

377

10 Boolean logic

5 The following truth table is for a logic gate called A B X
the XNOR gate. 0 0 1
By completing the truth table below, show 0 1 0
that the XNOR gate can be represented by the 1 0 0
following logic expression: 1 1 1

(A AND B) OR (NOT A AND NOT B)

A B (A AND B) (NOT A AND (A AND B) OR
NOT B) (NOT A AND NOT B)

00

Advice 01

Regarding question 5, 10
XNOR gates are not on
the syllabus 11

Extension Using logic ‘building blocks’
One very common ‘building block’ is the NAND
The following two exercises are designed to help gate. It is possible to build up any logic gate,
students thinking of furthering their study in Computer and therefore any logic circuit, by simply linking
Science at A Level standard. The two topics here are together a number of NAND gates. For example,
not on the syllabus and merely show how some of the the AND, OR and NOT gates can be built from NAND
topics in this chapter can be extended to this next level. gates as shown here in Figure 10.34:
The two topics extend uses of logic circuits in the real
world and the use of full adders and half adders. The AND gate:

Topic 1: Logic circuits in the real world A FX
B
Anybody reading this chapter with an electronics
background will be aware that the design of logic The OR gate: F
circuits is considerably more complex than has been A
described.
This chapter has described in detail some of the X
fundamental theories used in logic circuit design. This
will give the reader sufficient grounding to cover all BG
existing IGCSE and O Level syllabuses. However, it
is worth finally discussing some of the other aspects The NOT gate: X
of logic circuit design that will interest any student A
considering the A Level course. F
Electronics companies need to consider the cost of ▲ Figure 10.34
components, ease of fabrication and time constraints
when designing and building logic circuits. We will Task 1
outline two possible ways electronics companies can
standardise logic circuit design: By drawing the truth tables, show that the three
circuits in Figure 10.34 can be used to represent
» One method is to use ‘off-the-shelf’ logic units and AND, OR and NOT gates.

build up the logic circuit as a number of ‘building
blocks’

» Another method involves simplifying the logic

circuit as far as possible; this may be necessary
where room is at a premium (for example, in
building circuit boards for use in satellites to allow
space exploration).

378

10.3 Logic circuits, logic expressions, truth tables and problem statements

Task 2

1 Show how the following logic circuit could be built using NAND gates only.
Also complete truth tables for both logic circuits to show that they produce

identical outputs.

AJ
B

X

CK
▲ Figure 10.35

2 Show how the XOR gate could be built from NAND gates only.
Complete a truth table for your final design to show it that it produces the

same output as a single XOR gate.

Task 3

By drawing a truth table, which single logic gate has the same function as the
following logic circuit made up of NAND gates only?

AF

HX

B G
▲ Figure 10.36

Topic 2: Half adder and full adder circuits » the sum bit (S)
» the carry bit (C).
In Chapter 10, the use of logic gates to create logic
circuits to carry out specific tasks was discussed If you consider 1 + 1 this will give the result 1 0
in much detail. Two important logic circuits used in (denary value 2). The ‘1’ is the carry and ‘0’ the sum.
computers are: As a truth table this is:

» the half adder circuit INPUT OUTPUT
» the full adder circuit.
AB SC
Half adder 00 00
One of the basic operations in any computer is binary 01 10
addition. The half adder circuit is the simplest circuit; 10 10
this carries binary addition on 2 bits generating two 11 01
outputs:

379

10 Boolean logic

This is often shown in graphic form as: As you have probably guessed already, the half adder
is unable to deal with the addition of more than two
A 1-bit S (sum) bits (for example, an 8-bit byte). To enable this, we
half have to consider the full adder circuit.

B adder C (carry)

▲ Figure 10.37 S (sum)
Or as a logic circuit:

A
B

C (carry)

▲ Figure 10.38

Full adder
Consider the following binary sum using 5-bit numbers:

A 0 1 [1] 1 0 This is the sum produced from the addition Link
B 0 0 [0] 1 1 This is the carry from the previous bit position
S 1 0 [0] 0 1 See Section 1.1 for more details of
C 1 1 [1] binary addition.

The sum shows how we have to deal with CARRY from the
previous column. There are three inputs to consider in this third column,
for example, A = 1, B = 0 and C = 1 (S = 0). This is why we need to join
two half adders together to form a full adder, as shown in Figure 10.40

▲ Figure 10.39

A Half Half S (sum)

B adder adder

Cin

OR Cout (carry)
gate

▲ Figure 10.40
This has an equivalent logic circuit; there are a number
of ways of doing this. For example, the following logic
circuit uses OR, AND and XOR logic gates:

A OR gate
B
Cout

Half adder

S

Half adder
Cin

▲ Figure 10.41
380

10.3 Logic circuits, logic expressions, truth tables and problem statements

Truth table for the full adder circuit: As with the half adder circuits, different logic gates
can be used to produce the full adder circuit.
INPUT OUTPUT The full adder is the basic building block for multiple
binary additions. For example, the following diagram
A B Cin S Cout shows how two 4-bit numbers can be summed using
000 00 four full adder circuits:
001 10
010 10
011 01
100 10
101 01
110 01
111 11

A3 B3 A2 B2 A1 B1 A0 B0

Full adder Full adder Full adder Full adder C0
C4 C3 C2 C1

S3 S2 S1 S0

▲ Figure 10.42

In this chapter, you have learnt about:
✔ recognise the functions, symbols and truth tables for the logic gates:

NOT, AND, OR, NAND, NOR and XOR
✔ create logic circuits from a given problem, logic expression or truth table
✔ complete a truth table from a given problem, logic (or Boolean) expression or

logic circuit
✔ write a logic (or Boolean) expression from a given problem, logic circuit or truth

table

Key terms used throughout this chapter
logic gate – an electronic circuit that relies on ‘on/off’ logic; the most common gates are
NOT, AND, OR, NAND, NOR and XOR

logic circuit – these are formed from a combination of logic gates and designed to carry out
a particular task; the output from a logic circuit will be 0 or 1

truth table – a method of checking the output from a logic circuit; a truth table lists all the
possible binary input combinations and their associated outputs; the number of outputs
will depend on the number of inputs; for example, two inputs have 22 (4) possible binary
combinations, three inputs have 23 (8) possible binary combinations, and so on

Boolean algebra – a form of algebra linked to logic circuits and based on TRUE or FALSE

381

10 Boolean logic

Exam-style questions

1 a Produce:
i a Boolean or logic expression
ii a logic circuit

for the truth table shown:

ABX
000
011
100
110

[4]
b Produce:

i a logic expression
ii a truth table
for the logic circuit shown below:

A
BX

C [6]

X

2 a Write a logic expression for the following logic circuit:

A

B

[3]

382

Exam-style questions

b Draw a logic circuit which represents the following
Boolean expression:
X = NOT (A AND B) OR (A AND NOT B) [3]

c Complete the truth table for the following logic circuit:

A

X

B

C [4]



3 A motor driving a water pump has a safety system which uses three
inputs to a logic circuit. A certain combination of conditions results
in an output, X, from the logic circuit being equal to 1. When the
value of X = 1 then the motor and pump are shut down.

The following table shows which parameters are being monitored
and form the three inputs to the logic circuit.

Parameter description Parameter Binary value Description of condition
motor speed S 0 motor speed <= 2000 rpm
1 motor speed > 2000 rpm
bearing temperature T 0 bearing temperature <= 90°C
1 bearing temperature > 90°C
water velocity V 0 water velocity <= 5 m/s
1 wind velocity > 5 m/s

The output, X, will have a value of 1 if any of the following combination [7]
of conditions occur: [4]

» either motor speed > 2000 rpm and bearing temperature > 90°C
» or motor speed <= 2000 rpm and water velocity <= 5 m/s
» or bearing temperature > 90°C and water velocity <= 5 m/s
a Design a logic circuit for the above scenario.
b Complete a truth table for the above scenario.

383

10 Boolean logic 4 a Write a logic expression for the truth table below.

384 XYZ [4]
001
010
101
110

b Draw a logic circuit from the above truth table.
5 A factory manufactures plastic pipes. It uses logic circuits to control

the manufacturing process.
a Consider the logic gate:

Input A Output
Input B

Complete the truth table for this logic gate.

Input Input Output
A B

00

01

10

11

[1]

b Consider the truth table:

Input Input Output
A B 0

0 0

01 1

10 1

11 0

State the single logic gate that produces the given output. [1]

c Plastic pipes of various sizes are manufactured by heating the
plastic and using pressure. The manufacturing system uses
sensors to measure the pressure (P), temperature (T) and speed
(S) of production.

The inputs to the manufacturing system are:

Input Binary value Condition
P 1 pressure is > 5 bar
0 pressure is <= 5 bar
T 1 temperature is > 200 degrees Celsius
0 temperature is <= 200 degrees Celsius
S 1 speed is > 1 metre per second
0 speed is <= 1 metre per second

Exam-style questions

The system will sound an alarm (X) when certain conditions are detected. The
alarm will sound when:

temperature is > 200 degrees Celsius and the pressure is <= 5 bar [5]
or
speed is > 1 metre per second and the temperature <= 200 degrees Celsius

Draw a logic circuit to represent the above alarm system.
Logic gates used must have a maximum of two inputs.

P

TX

S



d Give two benefits of using sensors to monitor the manufacture [2]
of the plastic pipes.

Cambridge IGCSE Computer Science (0478) Paper 11 Q7, Oct 2019

6 A DVD recorder is protected by three sensors (S, T and P). The output
from these sensors forms the inputs to a logic circuit. A certain
combination of input values produces an output of 1 from the logic circuit.
When this occurs a warning message is shown on the DVD display.

The following table shows which parameters are being monitored
and form the three inputs to the logic circuit:

Parameter description Parameter Binary value Description of condition
rotation speed S 0 rotation speed >= 1000 rpm
tilt angle T 1 rotation speed < 1000 rpm
laser power P 0 tilt angle >= 30°
1 tilt angle < 30°
0 laser power < 150 mW
1 laser power >= 150 mW

The output X will have a value of 1 if any of the following combination [2]
of conditions occurs: [6]

» either rotation speed >= 1000 rpm and tilt angle < 30°
» or rotation speed < 1000 rpm and laser power >= 150 mW
» or tilt angle >= 30° and laser power < 150 mW
a Write down a logic or Boolean expression for the above system.
b Draw a logic circuit to monitor the above system.

385

10 Boolean logic

c Complete the truth table for the above system:

Input values Working space Output
STP X
000
001
010
011
100
101
110
111

[4]

386

Index

2D scanners 96–7 passwords and user names 200 capacitive touch screens 98–9
3D printers 106–7 two-step verification 204 cars
3D scanners 97, 98 auto-completion 173
auto-documenters 173 adaptive cruise control 223
A automated systems 217 anti-lock braking systems 115
agricultural applications 224–5 autonomous 233
abnormal data 281 gaming devices 226 embedded systems 84–5
Abstract Data Types (ADTs) 292 industrial applications 218–20 self-parking 221–2
accelerometers 112 lighting applications 227–8 CASE statements
access levels 198–9 in scientific research 228–9 programming languages 311–12
Access Point Mapping 190 transport applications 221–3 pseudocode 266, 268
accumulator (ACC) 77 weather stations 225 CDs 126, 128
acoustic sensors 112, 114 automatic repeat requests (ARQs) 62 central heating systems 116
actuators 101, 217 autonomous vehicles 233–6 central processing unit (CPU) 75
adaptive cruise control 223 averages (mean) 274 components of 76–9
address bus 79 Fetch–Decode–Execute cycle
administrators 160 B
adware 193 79–80
airplanes, autonomous 235–6 backing store 77 char data type 304
algorithms 264 back-up software 153–4 character sets
bandwidth 34
bubble sort 275–6 barcodes 88–90 ASCII code 25–8
counting 272 Binary Coded Decimal (BCD) system Unicode 28
error identification 285–7 charge couple devices (CCDs) 92
flowcharts 262–4 38 chatbots 242
linear search 274–5 binary system 2–3 check digits 59–62, 279
maximum, minimum and averages checkouts 89
addition 15–17 checksum 59
273–4 conversion from denary 4–6 chemical process control 116, 228–9
purpose of 271 conversion to denary 3–4, 22–5 ciphertext 63
sequence 307–9 conversion to/from hexadecimal clock cycle 80
totalling 272 clock speed 80–1
writing and amending 288–91 8–9 cloud storage 130–1
analogue to digital converters (ADCs) logical shifts 17–20 code editors 171
92, 95, 111 negative numbers 20–5 colour codes, HTML 13–14
analysis 258–9 subtraction 38–9 colour depth 31
AND operator 318, 359 two’s complement 20–5 Command Line Interfaces (CLIs) 156,
AND gate 358 binder 3D printing 106 157
anti-lock braking systems (ABS) 115 biometrics 97, 201 comments 329
anti-malware 199 BIOS (Basic Input/Output System) 81, comparison operators 267
anti-virus software 151 122, 160–1 compilers 150, 168–9, 170
application software 148–9 bit depth (sampling resolution) 30 Complementary Metal Oxide Semi-
Arithmetic & Logic Unit (ALU) 76 bitmap images 30–1 conductors (CMOS) 95, 161
arithmetic operators 317 bits 32 computed tomographic (CT) scanners
arrays 329 blockchains 187–8 98
one-dimensional (lists) 329–31 Bluetooth 139 computer architecture 75–80
two-dimensional (tables) 331–2 Blu-ray discs 127–8 computer systems 260
artificial intelligence (AI) 241–2 Boolean data type 304, 343 conditional statements 266
deep learning 250–1 Boolean operators 318 condition-controlled loops 313–14
expert systems 243–6 booting up 160 constants 302–3
machine learning 247–8 boundary data 282 control bus 79
ASCII code 25–7 browsers (web browsers) 181, 182 control gate transistors 124, 125
disadvantages 28 brute force attacks 189 control systems 113–14, 115–17
extended 27 bubble sort 275–6 control unit (CU) 76
assemblers 169 buffers 161–3 controllers 224, 231
assembly language 166, 167–8 buses 77, 79 cookies 184–6
assignment statements 265 bytes 32 cores 81
asymmetric encryption 64–5 count-controlled loops 313
authentication 199 C counting 272, 314
biometrics 201–3 cryptocurrency 187
cables 139
cache memory 81

387

INDEX

current instruction register (CIR) 77 dynamic IP addressing 135–6 Graphical User Interfaces (GUIs)
cyber security see security dynamic RAM (DRAM) 121, 122 156–7
cyclic redundancy checks (CRCs) 46
E greenhouse environment control 117
D
echo check 59 H
data bus 79 EEPROM 161
data compression 34 emails hacking 191
half-duplex data transmission 50
lossless 35–7 cyber security 205–7 hard disk drives (HDD) 123–4
lossy 34–5 spam filtering 247
data corruption 54 embedded systems 83–4 defragmentation 151–3
data interception 190 digital cameras 92 hardware management 158
data packets 45–8 examples 84–7 hertz (Hz) 30
data redundancy 130 encryption 63 heuristic checking 151
data storage asymmetric 64–5 hexadecimal system (hex) 7
file size calculations 33 quantum cryptography 67–8
memory size systems 32 symmetric 63–4 conversion to/from binary 8–9
data transmission 49 end-effectors 232 conversion to/from denary 10–11
encryption 63–8 error checking 172 uses 12–14
error detection 54–62 error codes 12 High-definition Multimedia Interface
parallel 51, 52 error detection 54 (HDMI) ports 138
serial 50, 52 in algorithms 285–7 high-level languages 166, 167
simplex, half-duplex and full-duplex automatic repeat requests 62 hopping 48
check digits 59–62 human computer interface (HCI) 156–7
50 checksum 59 humidity sensors 112, 117
USB 52–3 echo check 59 HyperText Mark-up Language (HTML)
data types 304, 342–3 parity checking 55–8 183
Database Management Systems ethical hacking 191 colour codes 13–14
(DBMs) 352 expert systems 243–6 hypertext transfer protocol (http) 181
databases 339 extreme data 282
fields and records 340–1 I
practical use 348–50 F
primary keys 343–4 IF statements
SQL 344–7 face recognition 97, 202 programming languages 310–11
validation 341–2 Fetch–Decode–Execute cycle 79–80, pseudocode 266–8
debuggers 172
declaration statements 302–3 174 image representation 30–1
decomposition 258–9, 260–1 file handling 333–5 digital cameras 92–3
deep learning 250–1 File History utility 153 JPEG files 35
defragmentation 151–3 file management 159
denary system 3 file size calculations 33 image resolution 31
conversion from binary 3–4 fingerprint scans 201–2 Immediate Access Store (IAS) 77
conversion to binary 4–6, 22–5 firewalls 137, 207–8 inference engines 244
conversion to/from hexadecimal firmware 160, 161 infrared sensors 112, 114
flash memory 124–6 infrared touch screens 99–100
10–11 flip flops 121 inkjet printers 104, 105
two’s complement format 22 floating gate transistors 124, 125 input devices 78
denial of service (DoS) attacks 190–1 flow rate sensors 112
device drivers 150, 154–5 flowcharts 262 barcode scanners 88–90
digital cameras 92–3 at checkouts 89
digital currency 186–7 flow lines 264 digital cameras 92–3
digital light projectors 102, 103 symbols 263 keyboards 93–4
digital to analogue converters (DACs) FOR loops microphones 94–5
109 programming languages 313 optical mouse 95–6
direct 3D printing 106 pseudocode 269 scanners 96–8
disk thrashing 130 format checks 279 touch screens 98–101
distributed control systems (DCS) 219 fragmentation 124 input statements 270, 304–5
distributed denial of service (DDoS) frame QR codes 91 instruction sets 82
attacks 190–1 full-duplex data transmission 50 integers 304, 343
DIV 317, 327–8 functions 321, 324–5 Integrated Development Environments
DNS cache poisoning 195 (IDEs) 170–3, 299–300
Domain Name Server (DNS) 183 G internet 180–1
dongles 126 Internet Protocol (IP) addresses 13,
dual core systems 81 gaming devices 226 134
DVDs 126, 127, 128 gas sensors 112 dynamic and static 135–6
global variables 325–6 interpreters 169, 170
interrupt service routine (ISR) 162
interrupts 161–3, 174
irrigation systems 224–5

388