Scribd
Upload
35 views2 pages

EE2417 Intro To Computing S1!24!25 HW2

Uploaded by

khoa.nguyenxuan273
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
35 views2 pages

EE2417 Intro To Computing S1!24!25 HW2

Uploaded by

khoa.nguyenxuan273
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

The HCMC University Of Technology – Faculty of Electronics and Electrical Engineering, EE2417, HW #2

Introduction to Computing
EE2417
Homework #2
CTTIEN Lecturer: Hoang Trang [email protected]
Student name and ID Grade

Deadline Due to: request from Lecturer (on LMS system)


Note:
Write down your work on answer sheet. Show your work. Don’t COPY.

How to submit your Homework online?


1. You must do HW by your own handwriting on the paper.
2. In each page, you have to write your full name, your signature.
2. Number the pages in order.
3. Take a photo (by smartphone, ...) for each page.
4. Merge photos/images and convert into only ONE pdf file using some free tools (for example:
smallpdf.com).
5. Name your pdf file: HWx-your full name-yourID. pdf
6. Submit your pdf file on BK-elearning system before the deadline
This is hard deadlines. No exception.
So, you should not submit your HW at the last minutes before the deadline.

2.1 Demonstrate the validity of the following identities by means of truth tables:
(a) DeMorgan’s theorem for three variables: (x + y + z)’ = x’y’z’ and (xyz)’ =x’ + y’ + z’
(b) The distributive law: x + yz = (x + y)(x + z)
(c) The distributive law: x(y + z) = xy + xz
(d) The associative law: x + (y + z) = (x + y) + z
(e) The associative law and x(yz) = (xy)z
2.2 Simplify the following Boolean expressions to a minimum number of literals:
(a) xy + xy’
(b) (x + y) (x + y’)
(c) xyz + x’y + xyz’
(d) (A + B)’(A’ + B’)’
(e) (a + b + c’)(a’ b’ + c)
(f) a’bc + abc’ + abc + a’bc’
2.3 Simplify the following Boolean expressions to a minimum number of literals:
(a) ABC + A’B + ABC’ (b) x’yz + xz
(c) (x + y)’(x’ + y’) (d) xy + x(wz + wz’)
(e) (BC’ + A’D) (AB’ + CD’) (f) (a’ + c’) (a + b’ + c’)
2.4 Reduce the following Boolean expressions to the indicated number of literals:
(a) A’C’ + ABC + AC’ to three literals
(b) (x’y’ + z)’ + z + xy + wz to three literals
(c) A’B(D’ + C’D) + B(A + A’CD) to one literal
(d) (A’ + C) (A’ + C’) (A + B + C’D) to four literals
(e) ABC'D + A'BD + ABCD to two literals

2.5 Draw logic diagrams of the circuits that implement the original and simplified expressions in
Problem 2.2.
2.6 Draw logic diagrams of the circuits that implement the original and simplified expressions in
Problem 2.3.
2.7 Draw logic diagrams of the circuits that implement the original and simplified expressions in
Problem 2.4.

1
The HCMC University Of Technology – Faculty of Electronics and Electrical Engineering, EE2417, HW #2

2.8 Find the complement of F = wx + yz; then show that FF’ = 0 and F + F’ = 1.
2.9 Find the complement of the following expressions:
(a) xy’ + x’y
(b) (a + c) (a + b’) (a’ + b + c’)
(c) z + z’(v’w + xy)
2.10 Given the Boolean functions F1 and F2 , show that
(a) The Boolean function E = F1 + F2 contains the sum of the minterms of F1 and F2.
(b) The Boolean function G = F1F2 contains only the minterms that are common to F1 and F2.

You might also like