CSE140 - HW #5
Due Sunday March 8, 11:59PM
PartA: Decoders and Multiplexers
Questions in this section will be graded
1. (Decoders) Given three four-input Boolean functions
f1 (a, b, c, d) =
m(0, 3, 4, 7, 8) +
f2 (a, b, c, d) =
m(0, 4, 14) +
f3 (a, b, c, d
CSE 140: Homework 4
Problems to grade:
1. All parts
3 (a)
Total Points - 40
1
(I) [Rubric: Total 5 points.
Full credit if nal circuit is drawn directly
+2 points for correct truth table (Need not have Q(t+1).
+2 points for coming up with J and K equations
CSE 140: Homework 2
Total : 30 points, Grade only 4.2 and 5.2, deduct 3 points overall if submission is late
Problem 2
From circuit to minimal circuit
Y (A, B, C, D) = A0 D + AC 0 D + AB 0 C + ABCD
Z(A, B, C, D) = BD + AC 0 D
id
0
1
2
3
4
5
6
7
8
9
10
11
CSE 140: Homework 1
Total : 30 points, Grade only 2.1,3, 4.1, deduct 3 points overall if submission is late
Problem 2
2.1
Prove the equations using Boolean algebra
LHS: abc + b0 d + c0 d + ad
= abc + b0 d + c0 d + ad.1.1
0
0
0
[Identity]
0
0
0
= abc + b d