Question: Question 3 ( a ) Given a Boolean expression, x = x Y Z + x b a r ( Y ) ( ? b

Question 3
(a) Given a Boolean expression, x=xYZ+xbar(Y)(?barxbar(?bar(Z))).
(i) Simplify the expression using Boolean Law.
(7 marks)
( ii ) Construct a combinatorial logic circuit using inverters, OR gates, and AND gates for the expression x.
(5 marks)
( iii) Give two applications of Boolean algebra in Information Technology.
(2 marks)
(b)(i) Find the output of the combinatorial circuits figure below:
(1 mark)
( ii ) Use a K-map to minimize the following sum-of-products expression:
x?b=ar(A)Bbar(C)D+barAbar(B)CD+ABbar(C)D+bar(A)BCD+ABCD+ABbarCbar(D)+bar(A)BbarCbar(D)+barAbarBbar(C)D+ABCbar(D)
x=xbar(y)z+xybar(z)+xyz+xybar(z)+xbarzbar(z)
(9 marks)
5Question 4
(a) Determine whether the following sentences are propositions or not.
(i) Ts Dr Soong conducts the test for students on Weekend.
(1 mark)
( ii ) Please ensure that you carefully read the question and record your answer on
the answer sheets.
(1 mark)
( iii )m+n=p
(1 mark)
(iv)109+361=400
(1 mark)
(v) Please ensure that you study diligently for MAT2204.
(1 mark)
(b) Let p,q and r be the propositions. Write each of the following statements in logical
notation form.
p: Ming Hooi obtain an A+ in the final exam.
q : Ming Hooi does each exercise in this book.
r : Ming Hooi obtain an A + in Ts Dr Soong' class.
(i) Ming Hooi didn't get an A in this class.
(1 mark)
( ii ) Do every exercise in this book is necessary and sufficient for Ming Hooi get an
A in the final exam.
(2 marks)
( iii ) If Ming Hooi do every exercise in this book and get an A in the final exam, then
she get an A in Ts Dr Soong' class.
(2 marks)
(c) Write the truth table for the proposition:
(i) not(notpq)(notq)
(7 mark)
( ii ),(pq)(notpq)
(7 marks)
( iii ) Hence, determine whether the two truth tables are equivalence.
Question 3 ( a ) Given a Boolean expression, x =

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!