Scribd
Upload
16 views5 pages

CAIE-IGCSE-Computer Science - Practical

The document provides summarized notes on the CAIE IGCSE Computer Science theory syllabus, focusing on Boolean logic and logic gates. It includes instructions on writing logic statements from circuits, truth tables, and problem statements. The notes are prepared for personal use and are updated for the 2023-2025 syllabus.

Uploaded by

anusha.kumari2562010
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views5 pages

CAIE-IGCSE-Computer Science - Practical

The document provides summarized notes on the CAIE IGCSE Computer Science theory syllabus, focusing on Boolean logic and logic gates. It includes instructions on writing logic statements from circuits, truth tables, and problem statements. The notes are prepared for personal use and are updated for the 2023-2025 syllabus.

Uploaded by

anusha.kumari2562010
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

ZNOTES.

ORG

UPDATED TO 2023-2025 SYLLABUS

CAIE IGCSE
COMPUTER SCIENCE
SUMMARIZED NOTES ON THE THEORY SYLLABUS
Prepared for Laila for personal use only.
CAIE IGCSE COMPUTER SCIENCE
| A | B | Output | |----|----|----| | 0 | 0 | 0 | | 0 | 1 | 1 | | 1

1. Boolean Logic |0|1||1|1|0|

1.1. Logic Gates and their functions


Six types of logic gates
2. Writing Logic Statements
NOT Gate
AND Gate Logic Statements is a way of showing all the logics that are in
OR Gate place for a logic circuit.
NAND Gate
NOR Gate
XOR Gate
2.1. Writing from a logic circuit
1. Look at the ciruit and go around the logic gates used
NOT gate: an inverter, $\overline{A}$ in the circuit
| A | Output | |----|----| | 0 | 1 | | 1 | 0 | 2. Go from the one output that is being given towards
the input
3. Write the last gate ( the first gate you walk through )
in the middle and then, for each of the value coming
into the gate, leave space at the side
4. If the value coming into the gate is coming from
AND gate: $\text{A.B}$ another gate, use a bracket for the gate’s logic
5. Repeat process 3-4 till you are able to reach the input
| A | B | Output | |----|----|----| | 0 | 0 | 0 | | 0 | 1 | 0 | | 1 values fully
|0|0||1|1|1|
2.2. Writing from a truth table
1. Create logic circuit fom the truth table (shown later)
2. Write the logic statement using the ciruit
OR gate: $A + B$
| A | B | Output | |----|----|----| | 0 | 0 | 0 | | 0 | 1 | 1 | | 1
2.3. Writing from a Problem statement
|0|1||1|1|1| 1. See what logics go in place in the statement to take
place
2. Go from the logic of any 2 inputs at the start, and
then keep on going until you are able to reach the
final gate which gives the output
NAND gate: $\overline{\text{A.B}}$ 3. When writing the statement, make sure you show the
| A | B | Output | |----|----|----| | 0 | 0 | 1 | | 0 | 1 | 1 | | 1 logic statement where the output is 1
|0|1||1|1|0|
2.4. Example of a LOGIC STATEMENT
(B AND C) OR (A NOR (A NAND C)) is the logic statement for
the following Logic Circuit
NOR gate: $\overline{A + B}$
| A | B | Output | |----|----|----| | 0 | 0 | 1 | | 0 | 1 | 0 | | 1
|0|0||1|1|0|

XOR gate: A ⨁ B​

WWW.ZNOTES.ORG Copyright © 2025 ZNotes Education & Foundation. All Rights Reserved. This document is
authorised for personal use only by Laila at Homeschooled on 03/05/25.
CAIE IGCSE COMPUTER SCIENCE

4. Logic Statements from


3. Creating Truth Tables Truth Tables
3.1. From Logic Circuits
1. Create a truth table with each input possible, creating
every possible combination of inputs . Tip: For the
first input, write it in the combination of 1,0,1,0
and so on. For the second, go 1,1,0,0 and so on,
and for the third one, go 1,1,1,1,0,0,0,0 going by
the powers of 2 for each input. This would
guarantee each possible combination
2. Run through the circuit with the inputs and get the
output that will be reached and write it accordingly

For logic statements, and problem statements, 1. Given the truth table above, take the rows where the
output (x) is 1 (Rows 1, 2, 4, 5, 6, 7)
convert them to logic circuits first and then do the
2. Create a logic expression from these rows (example,
rest row 1 will be (NOT A AND NOT B AND NOT C) = X
3. Create logic expressions for all the rows with output
3.2. Example 1 and connect them with OR gate

This is the example of a truth table of a logic circuit


5. Exam-Style Question

The circuit:

WWW.ZNOTES.ORG Copyright © 2025 ZNotes Education & Foundation. All Rights Reserved. This document is
authorised for personal use only by Laila at Homeschooled on 03/05/25.
CAIE IGCSE COMPUTER SCIENCE

1. The Conditions are given so make logic statements


using the conditions and the table. (NOT S AND T) OR
(S AND W) OR (NOT T AND W)
2. Make the logic circuit from the given equation
3. Make the truth table

WWW.ZNOTES.ORG Copyright © 2025 ZNotes Education & Foundation. All Rights Reserved. This document is
authorised for personal use only by Laila at Homeschooled on 03/05/25.
CAIE IGCSE
Computer Science

© ZNotes Education Ltd. & ZNotes Foundation 2025. All rights reserved.
This version was created by Laila on Sat May 03 2025 for strictly personal use only.
These notes have been created by Abdullah Aamir, Shriram S, Abhiram Mydi, Maimoona Junjunia & Adarsh SR Nalamalapu for the 2023-
2025 syllabus.
The document contains images and excerpts of text from educational resources available on the internet and printed books.
If you are the owner of such media, test or visual, utilized in this document and do not accept its usage then we urge you to contact us
and we would immediately replace said media. No part of this document may be copied or re-uploaded to another website.
Under no conditions may this document be distributed under the name of false author(s) or sold for financial gain.
"ZNotes" and the ZNotes logo are trademarks of ZNotes Education Limited (registration UK00003478331).

You might also like