Back to 课程
Computer Science GCES AQA
0% Complete
0/0 Steps
-
Representing Algorithms Aqa4 主题
-
Efficiency Of Algorithms Aqa1 主题
-
Searching Algorithms Aqa3 主题
-
Sorting Algorithms Aqa3 主题
-
Data Types Aqa1 主题
-
Programming Concepts Aqa5 主题
-
Arithmetic Relational And Boolean Operations Aqa1 主题
-
Data Structures Aqa3 主题
-
String Manipulation Aqa1 主题
-
Random Number Generation Aqa1 主题
-
Structured Programming Aqa2 主题
-
Robust And Secure Programming Aqa4 主题
-
Number Bases Aqa2 主题
-
Converting Between Number Bases Aqa3 主题
-
Units Of Information Aqa9 主题
-
Hardware And Software Aqa4 主题
-
Boolean Logic Aqa3 主题
-
Programming Languages And Translators Aqa2 主题
-
Cpu Architecture Performance And Embedded Systems Aqa4 主题
-
Memory Aqa2 主题
-
Secondary Storage Aqa3 主题
-
Fundamentals Of Computer Networks Aqa8 主题
-
Fundamentals Of Cyber Security Aqa1 主题
-
Methods Of Preventing Cyber Security Threats Aqa1 主题
-
Relational Databases Aqa2 主题
-
Ethical Legal And Environmental Impacts Aqa2 主题
课 17,
主题 3
In Progress
Truth Tables Aqa
课 Progress
0% Complete
Exam code:8525
AND Gates, OR Gates, NOT Gates & XOR Gates
What is a truth table?
-
A truth table is a tool used in logic and computer science to visualise the results of Boolean expressions
-
They represent all possible inputs and the associated outputs for a given Boolean expression
AND
|
Circuit symbol |
Truth Table |
|||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
![]() |
|
OR
|
Circuit symbol |
Truth Table |
|||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
![]() |
|
NOT
|
Circuit symbol |
Truth Table |
||||||
|---|---|---|---|---|---|---|---|
![]() |
|
XOR (exclusive)
|
Circuit symbol |
Truth Table |
||
|---|---|---|---|
![]() |
|




Responses