131 Week 3 - Boolean Logic

Question 1

Fundamental binary logical operators

Answer 1

AND, OR, NOT, XOR

Question 2

Truth tables

Answer 2

A way of representing outputs based on a set of inputs
Can be used to show the results of logic gates such as AND

Question 3

AND

Answer 3

• or ⋀ or <nothing></nothing>

Question 4

OR

Answer 4

+ or ⋁

Question 5

NOT

Answer 5

’ or ˉ (bar) or ¬

Question 6

XOR

Answer 6

⊕

Question 7

AND logic gate

Answer 7

https://media.geeksforgeeks.org/wp-content/uploads/20211105170309/SymbolofANDgate.jpg

Question 8

OR logic gate

Answer 8

https://media.geeksforgeeks.org/wp-content/uploads/20211107115351/SymbolofORgate.jpg

Question 9

NOT logic gate

Answer 9

https://media.geeksforgeeks.org/wp-content/uploads/20211107120202/SymbolofNOTgate.jpg

Question 10

XOR logic gate

Answer 10

https://media.geeksforgeeks.org/wp-content/uploads/20211107123017/SymbolofXORgate.png

Question 11

Inverted logic gates

Answer 11

NAND and NOR
Commonly used instead of AND/OR/NOT/XOR gates
NAND = NOT AND
NOR = NOT OR

Question 12

Why are NAND and NOR used instead of AND/OR/NOT/XOR

Answer 12

They are universal logic gates - any logic gate can be made using NANDs and NORs

Question 13

Approach for designing logic circuits

Answer 13

Write out a truth table
Derive a Boolean expression by ORing columns with an output of 1. (sum-of-products)
Translate Boolean expression into logic gates. May need to simplify expression or map AND/OR/NOT/XOR to NAND/NOR

Question 14

Karnaugh maps

Answer 14

A way of simplifying boolean expressions using a grid and boxing groups of true boxes:
https://www.physicsandmathstutor.com/pdf-pages/?https://www.physicsandmathstutor.com/computer-science-revision/a-level-ocr/data-types-structures-algorithms - data types advanced notes