Professional Documents
Culture Documents
EE210 Assignment2 Solution
EE210 Assignment2 Solution
EE210 Assignment2 Solution
Student Number:
I declare that this submission is my own, and that no part of it has been copied from another source except
where properly acknowledged.
Student’s signature:_________________________
Problem P1 P2 P3 P4 P5 P6 P7 Total
Mark
Maximum 10 10 10 10 10 10 10 70
Problem 1:
Answer:
xyz x(y + z) xy xz xy + xz
000 0 0 0 0
001 0 0 0 0
010 0 0 0 0
011 0 0 0 0
100 0 0 0 0
101 1 0 1 1
110 1 1 0 1
111 1 1 1 1
Answer:
xyz x y+z x + (y +z) (x + y) (x + y) + z
000 0 0 0 0 0
001 0 1 1 0 1
010 0 1 1 1 1
011 0 1 1 1 1
100 1 0 1 1 1
101 1 1 1 1 1
110 1 1 1 1 1
111 1 1 1 1 1
Problem 2:
Simplify the following Boolean expression to a minimum number of literals, then draw the logic diagrams of
the circuits that implements both the original and the simplified expressions.
a) 𝐴′ 𝐵′ 𝐶 + 𝐴𝐵′ 𝐶 + 𝐵𝐶
b) 𝑥 ′ 𝑦 ′ 𝑧 ′ + 𝑦′𝑧
Problem 3:
Alfaisal University - College of Engineering
Electrical Engineering Department
EE 210: Digital Logic Systems
Assignment #2
Spring 2021 - Due Date: March 8, 2021 at 11:59pm (midnight)
(A' + C)(A' + C')(A + B + C'D) = (A' + CC')(A + B + C'D) = A'(A + B + C'D) = AA' + A'B + A'C'D
= A'(B + C'D)
Problem 4:
We can perform logical operations on strings of bits by considering each pair of corresponding bits
separately. This is called a bit-wise logical operation.
Given the following two bit strings, A and B, evaluate the eight-bit result of the operations below.
𝐴 = 1011 0001
𝐵 = 0000 1110
a) 𝐴 𝐴𝑁𝐷 𝐵 = 00000000
b) 𝐴 𝑋𝑂𝑅 𝐵 = 10111111
c) 𝑁𝑂𝑇 𝐴 = 01001110
d) 𝐴 𝑁𝑂𝑅 𝐵 = 01000000
Problem 5:
𝐹(𝐴, 𝐵, 𝐶, 𝐷) = 𝐵′ 𝐷 + 𝐴′ 𝐷 + 𝐵𝐷 + 𝐵𝐶𝐷
Problem 6:
Problem 7:
Convert the following expression into a sum of products and a product of sums
𝑥′ + 𝑧(𝑥 + 𝑦 ′ )(𝑦 + 𝑧 ′ )