AQOIO-3-I-MCEG inal Exam Page | of 6 Answer All Questions QUESTION 1 25 Marks) (a) Determine whether the following statements are propositions or not, State the truth values of the propositions. @ x¥+2=3x when x=-1. Gi) In computers, subtraction is generally carri¢d out by 2’s complement. (iii) How far is it to the next town? (5 marks) (0) Write negation of the below statement by using DeMorgan’s law. “Kenny is smart and hardworking”. (3 marks) (c) Rewrite the below statement in the form of “if condition (hypothesis) then conclusion”. “Tt is necessary to have a valid password to log on to the server”. (2 marks) (d) Determine the truth value of the following statements. @ (#=3? 0) (1 mark) (i) 151 is a prime number and palindrome number. (1 mark) (iii) if x>Sthen x? <25 for 1 Asia Pacific University of Technology and Innovation YYYYMMDDINSTRUCTION: Answer ALL the questions QUESTION 1 (25 Marks) (a) (i)_—_—_—~Proposition, False (a2: al for proposition, al for False) (ii) Proposition, Truc (a2: al for proposition, al for true) (iii) | Not a proposition (al) (b) Kenny is not smart or not hardworking. (a3; a2 for not, al for “or”) (c) _ Ifyou have a valid password then you can log on to the server. (a2: al for condition, al for conclusion) (d) (i) True (ii) True (iii) False (a3: al for each) {e) (i) p: | study hard q: I get distracted rT can score distinction in MCFC module (m1 for propositions p, g, r) Note: Accept any other variables. Logical expression: (pa q)—>r (a3: al for each logical connectivity) (ii) Truth table (al) (al) (al) beet ‘Asia Pacific University of Technology and Innovation YYYYMMDD(iti) Indeterminant. (al) (a4: al for each row) QUESTION 2 (25 Marks) (a) ay't+ye'+x'z=x'yty'z4x” 0.1'+1.0'+ 0°.0=0'.1+1'.0+0.0" 1=1 (Hence showed) (m2) (b) (0.1).1"+ (1.0)' + (1-1) =0+14+0=1 (ml, al) Note: Method is optional. Accept direct answer. (c) x=l,y=1 or x=0,y=0 (a2: al for x value and al for y value/ accept either one of them) (d) A'B'C'+ A‘ BC'+ AB'C'+ AB'C + ABC = A'C( B's B)+ AB'C'+ AC(B"+ B) Distributive Law =A'C'.1+ ABC's ACA Complementarity Law = A'C'+ AB'C'+ AC Identity Law =C{(A'+ AB) + AC Distributive Law =C{(A'+ B+ AC Redundancy Law = A'C'+ B'C'+ AC (Shown) Distributive Law (m3 for simplification, m2 for naming of laws) Note: Accept other appropriate method. (ec) (i) = Tmthtable {al for all possible values of x, y, z) 2 (a2: al for each 4 correct values of function F) Gi) SOP expression: x'y'z+x"yz+ xy'z+ xyz'+ xyz (a3: al-for each correct two minterms, al for sum and one minterm) POS expression: (x+y+z)xtytz\x y+z). (a3: al-for each correct two maxterms) Level __, Asia Pacific University of Technology and Innovation YYYYMMDD; Note: Boolean AND operator (.) is not mandatory. Reduce } mark if - Boolean OR operator (+) used. (iii) © Simplified SOP expression: z+ xy (a5: a2 for answer; al-for 1’s, a2- for grouping) QUESTION 3 (25 Marks) (@ i deg(0) = 3,deg(1) = 3, deg(2) = 3,deg(3) = 3 deg(4) = 3,deg(5) = 3, deg(6) = 3, deg(7) = 3 (a2: al for each four correct degree) (ii) Adjacency list Adjacent vertices (a4: al for each two correct rows) Gii) . Planar graph does not exist. ’ (a2) (iv) Yes, Hamilton circuit exists. (al) (vy) (a2) SSeS Level 1 Asia Pacific University of Technology and Innovation YYYYMMDD10-3-1- ® @ Gi) oO @ di) @ (ii) (ii) 2e=10>e=5 Simple graph (4) @) @) @) (ml for Handshaking theorem, al), S) (a3, accept any other possible graph) Shortest path = a,c,d,e,g,z J (a2) Length of the shortest path = 3+3+1+5+4=16 (al) 3 (a2) Yes. Euler path exist. (al) Euler path: 1, 2, 3, 4, 2, 6, 4, 5, 1, 3, 5, 6. (a3: al for each correct 4 vertices) QUESTION 4 (25 Marks) (a) (i) Gi) (bt) (i) Gi) (iii) (iv) ) (wi) Not a tree because there is a simple circuit between vertices, (a2: al for “No”, al for reason) Yes. (al) 12 (al) 3 (al) 6,7, 8,9, 10, 11 (a3: al for cach 2 correct vertices) 135 (al) 6,8 (a2: al for each) subtree (@2) ~ Asia Pacific University of Technology and Innovation YYYYMMDD go ieee a i ela i eeFinal Exam:Marking Scheme_____.____Page Sof Wii) 2,4,8,9 ae o (a2: a for cach 2 vertices) vill) (A) Pre-order traversal: 1, 2, 6,7, 8,3, 4,9, 12, 5,10, 11 : “ (a3:-al for 4 consecutive vertices) -(B)— Invorder traversal: 6, 2, 7,8, 1, 3,4, 9, 12, 10, 5, LT (a3: al for 4 consecutive vertices) Oo cy) e ® oS Ca) O) (a4; al for 6 vertices, a3 for 5 edges) Note: Accept any other spanning tree. Level ~ Asia Pacitic University of Technology and Innovation | YYYYMMDDAdwwer atl questions. Each question carries § marks. 1 Give a direct proof, “If m is an odd integer then a’ -2n4 3is an even integer”. ‘We assume that is an odd integer. (Hypothesis) Let = 24 +1 (Definition of an odd integer where k is some integer) (ml) al 243% (2k 41) ~ 22k +1) 43 AN 614 Mk Ak 243 AK 42 20441) (m2) nt n2ne3~ 2m, where m=24? +1 (mis an integer) Theefore, »? ~2n43 is an even integer meee snes ENNRLE WTA neger env? ans an even integer” (Conclusion) ; an Use proof by cootradiction io prove that “if x? < 144 then [sf < 12. Rotoht If_x' S144, then we need to show that |x|<12. Suppose on contrary we have [do na: Then either x>12or x< 12: i (on 5 Ife>)2 then x > 144, ¢ Mf are-12 then s* > 144, 2 & {ax2: mt for each) In either case, we have « contradiction. Hence [x] 12. (my “Therefore, we have proved that if x7 5144 them |x] 12". at) AQHOSAACTC Quirk Making Scheme Sage dof 3. Givean indirect proof, if xis areal number and 1° ~Sx' + 6x ~30=0, then x= Suxing proof of contrapositive ‘We assume that the conclusion of the statement is false. If x ~Sx° +6x-30 = Othen x= Sis false. “ (et) Assume x 5, then BP =Sa? + 6x-30= xr) + 6(x~ 3) HAF OMS) 40 X46e00rx-S#0 (m3) ‘Therefore, we have proved that if x? —Sx° +6x~30=0 then x5. (ml) “Asia Pacib University of Technology and Irwovaiion a