AS Computer Science

Unit 1: Logical Operations

Term Definition Term Definition Exclusive separation (XOR)

Propositional • A proposition is simply a Truth table A truth table is a

logic statement. mathematical table used A B A AND B
to analyse a set of local 1 1 0
• When evaluated, propositional 1 0 1
statements.
statements will result in either
0 1 1
true or false.
0 0 0
• Propositional logic considers Connection (AND)
A AND B can be written with a symbol as A ⊕ B
the way statements interact
with each other.
A B A AND B
• Propositional logic follows 1 1 1 Bitwise manipulation and masking
mathematical rules. 1 0 0
0 1 0 Bitwise operations are similar to Boolean operations,
0 0 0 except they work on individual bits in a byte. A mask or
Logic statements bitmask is data that is used to carry out bitwise operations.
A AND B can be written using a symbol
as A.B Examples:
Most rules to simplify a logic statement are not Masking bits to 1, using 1111 0000 with an OR operation
dependent on the contents of the statement, but
1 0 0 1 0 1 0 1
on the structure of the statement. Separation (OR)
1 1 1 1 0 0 0 0
Propositional logic uses symbols to represent 1 1 1 1 0 1 0 1
logical links between propositions. A logic A B A AND B
statement includes propositions connected by This operation masks the four most significant bits leaving
1 1 1 the four remaining bits unchanged.
logical links.
1 0 1
Masking bits to 0, using 0000 1111 with an AND operation
0 1 1
Term Definition 0 0 0 1 0 0 1 0 1 0 1
0 0 0 0 1 1 1 1
Propositional Propositional logic uses symbols A AND B can be written using a symbol
0 0 0 0 0 1 0 1
logic symbols to represent logical links. as A + B
This operation masks the four most significant bits to zero
Symbol Formal term Informal leaving the remaining four bits unchanged.
term Negation (NOT) An XOR operation can be used to toggle bits
. Connection AND
1 0 0 1 1 1 0 1
+ Separation OR A Ā 0 0 0 0 1 1 1 1
1 0 1 0 0 1 0 0 1 0
Ā Negation NOT 0 1
1 0 0 1 0 1 0 1
⊕ Exclusive XOR A AND B can be written using a symbol 1 1 1 1 1 1 1 1
separation as Ā 0 1 1 0 1 0 1 0