SuperExamSuperExam
Search papers…
Menu
DashboardBrowse papersRevision notesBooksSavedRevision packsMy progressAchievementsAI TutorMessages

Unlock worked solutions

Step-by-step answers by examiners. From €5/mo.

Try Premium free →
← Computer Science notes
Edexcel ·Computer Science·Cambridge AS & A Level Computer Science

Logic Gates & Boolean Algebra

15 min read

The logic gates, truth tables, Boolean expressions and identities, logic circuits, and simplification with Karnaugh maps.

The logic gates

GateSymbol notationOutput is 1 when...
NOTĀinput is 0
ANDA·Bboth inputs are 1
ORA + Bat least one input is 1
NAND(A·B)̄NOT (both 1)
NOR(A + B)̄NOT (at least one 1)
XORA ⊕ Binputs differ

Viewing only

This content is free to read on superexams.com and cannot be printed or downloaded.

Read the full note — free

Create a free account to read this note in full. Every free account gets 2 complete revision notes — no card needed.

Sign up free →Log in

More Computer Science notes

Information Representation

Data Compression & Encryption

Communication & Networking

Hardware & the Processor