Professional Documents
Culture Documents
Solution:: BC170405115 Ahmad Hassan Cs302 Assignment No 1
Solution:: BC170405115 Ahmad Hassan Cs302 Assignment No 1
Solution:: BC170405115 Ahmad Hassan Cs302 Assignment No 1
AHMAD HASSAN
Cs302
Assignment no 1
Solution:
(725157)0
(725157)0 =229376+8192+2560+64+40+7
(725157)0 = (240239)D
(F12ADE)H
(F12ADE)H = (15) 1048576+1 65536+2 4096+ (10) 256+ (13) 16+ (14) 1
(F12ADE)H =15728640+65536+8192+2560+208+14
(F12ADE)H= (15805150)D
(101101010101011111001110101)2
According to Sum-of-non-Zero-Items:
(101101010101011111001110101)2
= (1x226)+ (1x224)+ (1x223)+ (1x221)+ (1x219)+ (1x217)+ (1x215)+ (1x213)+ (1x212) + (1x211) +
(1x210) + (1x29) + (1x26) + (1x25) + (1x24) + (1x22) + (1x21)
BC170405115
AHMAD HASSAN
Cs302
Assignment no 1
= (95075957)D
So by A+B-C-D
= (240239)D+(15805150)D-(95075957)D-(9925)D
Answer= - (79040493)D
1. (𝐸𝐴𝐶129)𝐻
Solution:
(EAC129) = (15384873)D
(15384873)D= (111010101100000100101001)2
Let binary code b2, b2, b1, b0. Then the respective gray code can be obtained as follow: -
i.e.
g3 = b3
g2 = (b3 ⊕ b2)
g1 = (b2 ⊕ b1)
g0 = (b1 ⊕ b0)
G9 0 B9 = (G10⊕G9) (0⊕0) 0
G8 1 B8 = (G9⊕G8) (0⊕1) 1
BC170405115
AHMAD HASSAN
Cs302
Assignment no 1
G7 0 B7 = (G8⊕G7) (1⊕0) 1
G6 0 B6 = (G7⊕G6) (0⊕0) 0
G5 1 B5 = (G6⊕G5) (0⊕1) 1
G4 0 B4 = (G5⊕G4) (1⊕0) 1
G3 1 B3 = (G4⊕G3) (0⊕1) 1
G2 0 B2 = (G3⊕G2) (1⊕0) 1
G1 0 B1 = (G2⊕G1) (0⊕0) 0
G0 1 B0 = (G1⊕G0) (0⊕1) 1
100111111010000110111101
Simplify the following Boolean expression to a minimum number of literals with complete steps.
State the property used in each step.
BC170405115
AHMAD HASSAN
Cs302
Assignment no 1
( A B E )( A C D)(C D E )( B D )( A E )
opening parentheses to match up all literals with their negations ( A.A=0)
( A B E )( A C D )(C D E )( B D ) A
( A B E )( A C D)(C D E )( B D ) E
( A B E )( A C D )(C D E ) AB
( A B E )( A C D)(C D E ) AD
( A B E )( A C D)(C D E ) BE
( A B E )( A C D)(C D E ) DE
( A B E )( A C D )(C D ) AB
( A B E )( A C D)(C D) AD
( A B E )( A C D)(C D) BE
( A B E )( A C D)(C D) DE
( A B E )( A C D ) ABE
( A B E )( A C D) ADE
( A B E )( A C D) B EE
0
( A B E )( A C D) D EE
0
( A B E )( A C D ) ABE
( A B E )( A C D) ADE
given that begining A and E =0
( A B E )( A C D) ADE
( A B E )( A C D) ADE
B ( A C D ) ABE
B ( A C D ) ADE
(C D) ABE
B (C D ) ADE
AB (C D) E (C D ) E
ABE (C D ) ( A A A)