0% found this document useful (0 votes)
18 views5 pages

CAIE-IGCSE-Computer Science - Practical

This document provides summarized notes on the CAIE IGCSE Computer Science theory syllabus, focusing on Boolean logic and logic gates. It includes explanations of various logic gates (NOT, AND, OR, NAND, NOR, XOR), how to write logic statements, create truth tables, and examples of logic circuits. The notes are intended for personal use and are updated for the 2023-2025 syllabus.

Uploaded by

sumareddy
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
0% found this document useful (0 votes)
18 views5 pages

CAIE-IGCSE-Computer Science - Practical

This document provides summarized notes on the CAIE IGCSE Computer Science theory syllabus, focusing on Boolean logic and logic gates. It includes explanations of various logic gates (NOT, AND, OR, NAND, NOR, XOR), how to write logic statements, create truth tables, and examples of logic circuits. The notes are intended for personal use and are updated for the 2023-2025 syllabus.

Uploaded by

sumareddy
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 suma for personal use only.
CAIE IGCSE COMPUTER SCIENCE
A B Output

1. Boolean Logic 0
0
0
1
1
1
1 0 1
1.1. Logic Gates and their functions 1 1 0

Six types of logic gates


NOT Gate
AND Gate
OR Gate NOR gate: A + B ​

NAND Gate
NOR Gate A B Output
XOR Gate 0 0 1
0 1 0
NOT gate: an inverter, A 1 0 0
1 1 0
A Output
0 1
1 0

XOR gate: A ⨁ B​
A B Output
AND gate: A.B 0 0 0
0 1 1
A B Output 1 0 1
0 0 0 1 1 0
0 1 0
1 0 0
1 1 1

2. Writing Logic Statements


OR gate: A + B Logic Statements is a way of showing all the logics that are in
place for a logic circuit.
A B Output
0 0 0 2.1. Writing from a logic circuit
0 1 1
1 0 1
1 1 1

NAND gate: A.B

WWW.ZNOTES.ORG Copyright © 2024 ZNotes Education & Foundation. All Rights Reserved. This document is
authorised for personal use only by suma at EISB on 30/12/24.
CAIE IGCSE COMPUTER SCIENCE

1. Look at the ciruit and go around the logic gates used 1. Create a truth table with each input possible, creating
in the circuit every possible combination of inputs . Tip: For the
2. Go from the one output that is being given towards first input, write it in the combination of 1,0,1,0
the input and so on. For the second, go 1,1,0,0 and so on,
3. Write the last gate ( the first gate you walk through ) and for the third one, go 1,1,1,1,0,0,0,0 going by
in the middle and then, for each of the value coming the powers of 2 for each input. This would
into the gate, leave space at the side guarantee each possible combination
4. If the value coming into the gate is coming from 2. Run through the circuit with the inputs and get the
another gate, use a bracket for the gate’s logic output that will be reached and write it accordingly
5. Repeat process 3-4 till you are able to reach the input
values fully For logic statements, and problem statements,
convert them to logic circuits first and then do the
2.2. Writing from a truth table rest
1. Create logic circuit fom the truth table (shown later)
2. Write the logic statement using the ciruit
3.2. Example
This is the example of a truth table of a logic circuit
2.3. Writing from a Problem statement
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
3. When writing the statement, make sure you show the
logic statement where the output is 1

2.4. Example of a LOGIC STATEMENT


The circuit:
(B AND C) OR (A NOR (A NAND C)) is the logic statement for
the following Logic Circuit

4. Logic Statements from


Truth Tables
3. Creating Truth Tables
3.1. From Logic Circuits

WWW.ZNOTES.ORG Copyright © 2024 ZNotes Education & Foundation. All Rights Reserved. This document is
authorised for personal use only by suma at EISB on 30/12/24.
CAIE IGCSE COMPUTER SCIENCE

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

5. Exam-Style Question

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 © 2024 ZNotes Education & Foundation. All Rights Reserved. This document is
authorised for personal use only by suma at EISB on 30/12/24.
CAIE IGCSE
Computer Science

© ZNotes Education Ltd. & ZNotes Foundation 2024. All rights reserved.
This version was created by suma on Mon Dec 30 2024 for strictly personal use only.
These notes have been created by Abdullah Aamir, Abhiram Mydi and Shriram Srinivas 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