Scribd
Upload
34 views2 pages

Computer Number Systems and Boolean Algebra Notes Formula Sheet

This document provides information about computer number systems and Boolean algebra formulas. It includes conversion tables for base 2, 8, 10, and 16 number systems. It also shows truth tables for logic gates like AND, OR, and XOR. The remainder of the document outlines Boolean algebra postulates, theorems, and rules for manipulating and simplifying Boolean expressions.

Uploaded by

Elaine zhu
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
34 views2 pages

Computer Number Systems and Boolean Algebra Notes Formula Sheet

This document provides information about computer number systems and Boolean algebra formulas. It includes conversion tables for base 2, 8, 10, and 16 number systems. It also shows truth tables for logic gates like AND, OR, and XOR. The remainder of the document outlines Boolean algebra postulates, theorems, and rules for manipulating and simplifying Boolean expressions.

Uploaded by

Elaine zhu
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/ 2

Computer Number Systems and Boolean Algebra Formula Sheet

Base 16 Conversion Table

Base 10 Base 16 Base 8 Base 2


0 0 0 0000
1 1 1 0001
2 2 2 0010
3 3 3 0011
4 4 4 0100
5 5 5 0101
6 6 6 0110
7 7 7 0111
8 8 10 1000
9 9 11 1001
10 A 12 1010
11 B 13 1011
12 C 14 1100
13 D 15 1101
14 E 16 1110
15 F 17 1111

Logic Gates

NOT A F �
𝑭𝑭 = 𝑨𝑨

AND OR XOR
2-Input 3-input 2-Input 3-Input 2-Input 3-Input
A A A A
A A B F F B F
F B F F B
B C B C C
𝑭𝑭 = 𝑨𝑨 ∗ 𝑩𝑩 𝑭𝑭 = 𝑨𝑨 ∗ 𝑩𝑩 ∗ 𝑪𝑪 𝑭𝑭 = 𝑨𝑨 + 𝑩𝑩 𝑭𝑭 = 𝑨𝑨 + 𝑩𝑩 + 𝑪𝑪 𝑭𝑭 = 𝑨𝑨⨁𝑩𝑩 𝑭𝑭 = 𝑨𝑨⨁𝑩𝑩⨁𝑪𝑪
NAND NOR NXOR/XNOR
2-Input 3-Input 2-Input 3-Input 2-Input 3-Input
A A A A A A
F B F F B F F B F
B C B C B C
𝑭𝑭 = �������
𝑨𝑨 ∗ 𝑩𝑩 𝑭𝑭 = ������������
𝑨𝑨 ∗ 𝑩𝑩 ∗ 𝑪𝑪 𝑭𝑭 = ��������
𝑨𝑨 + 𝑩𝑩 𝑭𝑭 = �������������
𝑨𝑨 + 𝑩𝑩 + 𝑪𝑪 �������
𝑭𝑭 = 𝑨𝑨⨁𝑩𝑩 �����������
𝑭𝑭 = 𝑨𝑨⨁𝑩𝑩⨁𝑪𝑪
Module: Computer Number Systems and Boolean Algebra

Boolean Algebra Rules

Postulates
𝐴𝐴 = 1 𝐴𝐴 = 0
1a 1b 1c
(if 𝐴𝐴 ≠ 0) (if 𝐴𝐴 ≠ 1)
2a 0⋅0 =0 2b 0+0=0 2c 0⊕0= 0
3a 1⋅1 =1 3b 1+1=1 3c 1⊕1= 0
4a 1⋅0 =0 4b 1+0=1 4c 1⊕0= 1
5c 0� = 0
5a 1� = 0 5b 0� = 1
5d 1� = 1
Algebra – Commutative
6a 𝐴𝐴𝐴𝐴 = 𝐵𝐵𝐵𝐵 6b 𝐴𝐴 + 𝐵𝐵 = 𝐵𝐵 + 𝐴𝐴 6c 𝐴𝐴 ⊕ 𝐵𝐵 = 𝐵𝐵 ⊕ 𝐴𝐴
Algebra – Associative
7a 𝐴𝐴(𝐵𝐵𝐵𝐵) = (𝐴𝐴𝐴𝐴)𝐶𝐶 7b 𝐴𝐴 + (𝐵𝐵 + 𝐶𝐶) = (𝐴𝐴 + 𝐵𝐵) + 𝐶𝐶 7c 𝐴𝐴 ⊕ (𝐵𝐵 ⊕ 𝐶𝐶) = (𝐴𝐴 ⊕ 𝐵𝐵) ⊕ 𝐶𝐶
Algebra – Distributive
8c 𝐴𝐴(𝐵𝐵 ⊕ 𝐶𝐶) = 𝐴𝐴𝐴𝐴 ⊕ 𝐴𝐴𝐴𝐴
8a 𝐴𝐴(𝐵𝐵 + 𝐶𝐶) = 𝐴𝐴𝐴𝐴 + 𝐴𝐴𝐴𝐴 8b 𝐴𝐴 + 𝐵𝐵𝐵𝐵 = (𝐴𝐴 + 𝐵𝐵)(𝐴𝐴 + 𝐶𝐶)
8d (𝐴𝐴 ⊕ 𝐵𝐵)(𝐴𝐴 ⊕ 𝐶𝐶) = 𝐴𝐴̅𝐵𝐵𝐵𝐵 + 𝐴𝐴𝐵𝐵� 𝐶𝐶̅
Basic Theorems
9a 𝐴𝐴 ⋅ 0 = 0 9b 𝐴𝐴 + 0 = 𝐴𝐴 9c 𝐴𝐴 ⊕ 0 = 𝐴𝐴
10a 𝐴𝐴 ⋅ 1 = 𝐴𝐴 10b 𝐴𝐴 + 1 = 1 10c 𝐴𝐴 ⊕ 1 = 𝐴𝐴̅
11a 𝐴𝐴 ⋅ 𝐴𝐴 = 𝐴𝐴 11b 𝐴𝐴 + 𝐴𝐴 = 𝐴𝐴 11c 𝐴𝐴 ⊕ 𝐴𝐴 = 0
12a ̅
𝐴𝐴 ⋅ 𝐴𝐴 = 0 12b ̅
𝐴𝐴 + 𝐴𝐴 = 1 12c 𝐴𝐴 ⊕ 𝐴𝐴̅ = 1
13a 𝐴𝐴̅ = 𝐴𝐴 13b 𝐴𝐴 = 𝐴𝐴̅ 13c 𝐴𝐴̅ = 𝐴𝐴̅
De Morgan’s Theorems
𝐴𝐴̅𝐵𝐵� = 𝐴𝐴 ��������
+ 𝐵𝐵 𝐴𝐴 + 𝐵𝐵 = 𝐴𝐴𝐴𝐴 𝐴𝐴̅ ⊕ 𝐵𝐵� = ��������
𝐴𝐴 ⊕ 𝐵𝐵
14a extends too 14b extends too 14c extends too
𝐴𝐴̅𝐵𝐵� 𝐶𝐶̅ = �������������
𝐴𝐴 + 𝐵𝐵 + 𝐶𝐶 𝐴𝐴 + 𝐵𝐵 + 𝐶𝐶 = 𝐴𝐴𝐴𝐴𝐴𝐴 𝐴𝐴̅ ⊕ �
𝐵𝐵 ⊕ 𝐶𝐶̅ = ���������������
𝐴𝐴 ⊕ 𝐵𝐵 ⊕ 𝐶𝐶
Absorption Theorems
15c 𝐴𝐴 ⊕ (𝐴𝐴̅ + 𝐵𝐵) = 𝐴𝐴𝐴𝐴 ����
15a 𝐴𝐴(𝐴𝐴 + 𝐵𝐵) = 𝐴𝐴 15b 𝐴𝐴 + 𝐴𝐴𝐴𝐴 = 𝐴𝐴 �
15d 𝐴𝐴 ⊕ 𝐴𝐴𝐴𝐴 = 𝐴𝐴𝐵𝐵
16c 𝐴𝐴(𝐴𝐴 ̅ ⊕ 𝐵𝐵) = 𝐴𝐴𝐴𝐴
16a 𝐴𝐴(𝐴𝐴̅ + 𝐵𝐵) = 𝐴𝐴𝐴𝐴 16b 𝐴𝐴 + 𝐴𝐴̅𝐵𝐵 = 𝐴𝐴 + 𝐵𝐵
16d 𝐴𝐴 ⊕ 𝐴𝐴̅𝐵𝐵 = 𝐴𝐴 + 𝐵𝐵
Multiplying Out
17a (𝐴𝐴 + 𝐵𝐵)�𝐴𝐴 + 𝐶𝐶� = 𝐴𝐴𝐴𝐴 + 𝐴𝐴𝐵𝐵 17b (𝐴𝐴 + 𝐵𝐵) ⊕ (𝐴𝐴̅ + 𝐶𝐶) = 𝐴𝐴𝐴𝐴 ������������
⊕ 𝐴𝐴̅𝐵𝐵
Consensus Theorems
18a 𝐴𝐴𝐴𝐴 + 𝐵𝐵𝐵𝐵 + 𝐴𝐴𝐶𝐶 = 𝐴𝐴𝐴𝐴 + 𝐴𝐴𝐶𝐶 18b (𝐴𝐴 + 𝐵𝐵)�𝐴𝐴 + 𝐶𝐶�(𝐵𝐵 + 𝐶𝐶) = (𝐴𝐴 + 𝐵𝐵)�𝐴𝐴 + 𝐶𝐶�
18c (𝐴𝐴 ⊕ 𝐵𝐵)�𝐴𝐴 ⊕ 𝐶𝐶�(𝐵𝐵 ⊕ 𝐶𝐶) = (𝐴𝐴 ⊕ 𝐵𝐵)�𝐴𝐴 ⊕ 𝐶𝐶� = (𝐴𝐴 ⊕ 𝐵𝐵)(𝐵𝐵 ⊕ 𝐶𝐶) = �𝐴𝐴 ⊕ 𝐶𝐶�(𝐵𝐵 ⊕ 𝐶𝐶)

You might also like