- 1 2 100 A Scan Or Take A Photo Of Your Assignment And Submit It As A Single Pdf File In Good Resolution Through 1 (143.37 KiB) Viewed 16 times
thanks !
1 / 2 100% + a Scan (or take a photo of) your assignment, and submit it as a single pdf file in good resolution through the LMS. On the first page of your assignment, write your name, your student number and your Practice class A day and time and include the following statement of originality: "This is my own work. I have not copied any of it from anyone else" which must be signed and dated by you Assignments are designed to help you master concepts, solve problems and develop your mathematical communication skills Considerable weight is given to the way you communicate your answers. 1. (a) Fill in the empty cells in the following Boolean Algebra input/output table. X V 2 1 f 2 faz XY X+ (x + 2) (x+y)(x+2) 0 0 0 1 1 0 1 0 0 1 1 1 0 0 1 0 0 1 1 0 1 ------ - ---- 1 0 0 1 1 1 0 0 0 0 1 0 1 1 0 0 0 0 1 1 1 0 0 1 1 0 0 1 1 1 0 0 1 0 (b) Use your answer to (a) to write down a Boolean Algebra result (c) Explain which Boolean Algebra axioms (a) to () and Boolean algebra results (k) to (u) of Section 2.2 of the Subject Text are required to justify each step of the following proof. Some steps require more than one justification For example Step (1) uses results (q) and (r), which are "de Morgan's laws" (x+2). at y) = (x-2)(+) = [(2) F] + ((E)- y = L(-)+[) y = [(* 1) - 2 + (x 3)-y = (x2)+(2-2) = [(x2). 1] + [(*)-) = (2-2). (1+1) (F-2)-1 f. CZEGGET DE OX TUT UR DX yz 2. (a) Enter is in the Karnaugh map for the Boolean function 8(w,x,y,z) = wxy + xy2 + wyż+wis + xy + wxyz. VE (b) Use the Karnaugh map algorithm to find the minimal expression for 8(w,x,y,z). VE 12