Multivector Review and Training Center

COMPUTER FUNDAMENTALS

For any number expressed in base-r system wherein the coefficients are multiplied
by powers of 10:
an a n-1a n-2 a n-3…….a2a1a0. a-1a-2a-3……a-m
= anrn + a n-1 r n-1 + a n-2 r n-2 + a n-3 r n-3 + …….+ a2r2 + a1r1 + a0r0
+…… + a-1r-1 + a-2r-2 + …….. + a-mr-m

Example:
1. (for base or radix equal to 10)
ana n-1 a n-2 a n-3……..a2a1a0 . a-1a-2a-3……a-m (each digit range from 0 to 9)
= an 10n + a n-1 10 n-1 + a n-2 10 n-2 + a n-3 10 n-3 + ……..+ a2 102 + a1 101
+ a0100 + a-1 10-1 + a-2 10-2 + a-3 10-3 +………+ a-m 10-m

2. (for base or radix equal to 2)

ana n-1 a n-2 a n-3…….a2a1a0.a -1 a -2 a -3……a-m (each digit is either 0 or 1)
= an2n + a n-1 2 n-1 + a n-3 2 n-3 +…… + a222 + a121 + a020 + a-12-1 + a-22-2
+ a-32-3 +……+ a-m 2-m

Table for Number of Various Bases

Decimal Binary Octal Hexadecimal

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

MRTC - 1
Multivector Review and Training Center

Complements

Two Types of Complement

a. diminished radix complement
or (r –1)’s complement
b. radix complement
or r’s complement

For diminished radix complement:

Given: N = number, r = base, n = no. of digit
(r – 1)’s complement of N = (r n – 1) – N

For radix complement:

Given: N = number, r = base, n = no. of digit
r ’s complement of N = rn – N , if N  0
r’s complement of N = 0, if N = 0

Laws for Boolean Algebra

x+0=x ; x1=x
x + x = 1 ; x  x = 0
x+x=x ; xx=x
x+1=1 ; x0=0

Involution (x) = x
Commutative x + y = y + x ; xy = yx
Associative x + (x + z) = (x + y) + z ; x (yz) = (xy)z
Distributive x(y + z) = xy + xz ; x + yz = (x + y)(x + z)
De Morgan (x + y) = x y ; (xy) = x + y
Absorption x + xy = x ; x(x + y) = x

Operator Precedence
For Boolean Expressions, the operator precedence is,
1. parentheses
2. NOT ()
3. AND ()
4. OR (+)

MRTC - 2
Multivector Review and Training Center

Operation Symbols Algebraic function Truth Table

x
AND y F F=xy xy F
00 0
01 0
10 0
11 1
OR x F=x+y xy F
y F
00 0
01 1
10 1
11 1
Inverter x F = x x F
F 0 1
1 0
Buffer F=x x F
x F 0 0
1 1
NAND x F = (xy) xy F
y F 00 1
01 1
10 1
11 0
NOR x F = (x + y) xy F
F
y 00 1
01 0
10 0
11 0
Exclusive OR x F = xy + xy xy F
(XOR) y F =xy 00 0
01 1
10 1
11 0
x
Exclusive – NOR F F = xy + xy xy F
y
Or equivalence =xy 00 1
01 0
10 0
11 1
Map Method
MRTC - 3
Multivector Review and Training Center

- also known as the “Veitch diagram” or the “Karnaugh map”. It

provides a simple straight forward procedure for minimizing Boolean
functions.
y
y
y yz
0 1 x 00 01 11 10
x
0 xy xy 0 xyz xyz xyz xyz

x{1 x y xy x{1 xyz xyz xyz xyz

Two Variable map z

Three-variable map

MRTC - 4