EE 101 Exam Grading Rules
1. If your work is illegible, you will receive no credit for that part of a problem. 2. Points will be deducted if equal signs are not utilized properly. That is, show all pertinent steps in a Boolean algebra operation; do n
Name_ I.D. _
#
EE 101 Exam Grading Rules
1. If your work is illegible, you will receive no credit for that part of a problem. This includes (but is not limited to) variable names, gate symbols, and Boolean operators. 2. Points will be deducted if eq
EE 311 Digital Hardware Organization
Chapter 2 Homework Solutions (Set 1)
2.1. The proof is as follows:
(x + y)(x + z) = xx + xz + xy + yz = x + xz + xy + yz = x(1 + z + y) + yz = x(1) + yz = x + yz
2.2. The proof is as follows:
(x + y)(x + y ) = x
EE 311 Digital Hardware Organization
Chapter 2 Homework Solutions (Set 2)
2.20 The simplest SOP implementation of the function is found as follows.
F = m(3,4,6,7) = x1x 2x 3 + x1x2 x3 + x1x 2 x3 + x1x 2x 3 = x 2x 3 ( x1 + x1 ) + x1x3 ( x2 + x 2 )
=
1
EE101 Chapter 5 Homework Handout Solution
1. Obtain the one's and two's complement representation of the following unsigned binary numbers. a) 10011000 b) 10011001 c) 10101100 d) 00000000 e) 10000000
a)
b)
c)
d)
e)
2
2. Perform the indicate