Scribd
Upload
15 views4 pages

Past Intake Exam - Set 2 MS

The document outlines the marking scheme for a final exam, consisting of multiple questions covering topics such as logical propositions, Boolean algebra, and graph theory. Each question is broken down into sub-questions with specific answers and explanations. The document includes various mathematical proofs and logical deductions related to the subjects being tested.

Uploaded by

Dinesh Cidoc
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views4 pages

Past Intake Exam - Set 2 MS

The document outlines the marking scheme for a final exam, consisting of multiple questions covering topics such as logical propositions, Boolean algebra, and graph theory. Each question is broken down into sub-questions with specific answers and explanations. The document includes various mathematical proofs and logical deductions related to the subjects being tested.

Uploaded by

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

AQ010-3-1-MCFC Final Exam-Marking Scheme Page 1 of 4

QUESTION 1 (20 Marks)

(a) (i) False


(ii) True
(b) If this loop does not contain a stop or a go to, then it will repeat exactly N times.
(c) (i) Eric found less than 3 errors in the system within a week.
(ii) Lynn is wise, and she is not brilliant in doing research.
(d) (i) (A) pqr
(B) ~ p  (q  r )
(ii) DATAENGFLAG is off, if and only if ERROR is not –1 or PRODUCT is less
than or equal to 50.
(e)
p q r r p ~ (r  p) ~q p ~ q  r ~ ( r  p )  ( p ~ q  r )
T T T F T F T T
T T F T F F T F
T F T F T T T T
T F F T F T T F
F T T T F F T F
F T F F T F F F
F F T T F T T F
F F F F T T T T
The compound proposition is indeterminant (shown).

QUESTION 2 (20 Marks)

(a) (i) ( AB + C ' ) D  '


(ii) When A = 1, B = 0, C = 1 and D = 1,
( AB + C ') D  ' = (1 0 + 1') 1 ' = ( 0 + 0 ) 1 ' = 0 ' = 1
(b) x = 0, y = 1 and x = 1, y = 1
(c) ( A '+ D )( B + C ') ' ( CD ') + A ' B '
= ( A '+ D ) ( B ' ( C ') ') ( CD ') + A ' B ' De Morgan’s Law
= ( A '+ D )( B ' C )( CD ') + A ' B ' Involution Law
= ( A '+ D )( B ' CD ') + A ' B ' Idempotent Law
= A ' B ' CD '+ B ' CD ' D + A ' B ' Distributive Law
= A ' B ' CD '+ B ' C ( 0 ) + A ' B ' Complementarity
= A ' B ' CD '+ 0 + A ' B ' Dominance Law
= A ' B ' CD '+ A ' B ' Identity Law
= A' B ' Absorption Law
(d) (i) SOP expansion: x ' y ' z '+ x ' yz '+ x ' yz + xy ' z '+ xy ' z + xyz
POS expansion: ( x + y + z ')( x '+ y '+ z )

Level 1 Asia Pacific University of Technology and Innovation


AQ010-3-1-MCFC Final Exam-Marking Scheme Page 2 of 4

(ii) First suggested answer:


yz
x 00 01 11 10

0 1 1 1

1 1 1 1
Simplified SOP expressions: y ' z '+ xz + x ' y
Second suggested answer:
yz
x 00 01 11 10

0 1 1
1

1 1 1 1
Simplified SOP expressions: x ' z '+ xy '+ yz

QUESTION 3 (20 Marks)

(a) Suppose m + n is even integer where m + n = 2i for some integers i.


Suppose n + p is even integer where n + p = 2 j for some integers j.
For m + n = 2i , m = 2i − n
For n + p = 2 j , p = 2 j − n
m + p = ( 2i − n ) + ( 2 j − n ) = 2 ( i + j − n ) = 2k
Since i, j and n are integers, hence k = i + j − n is integer as well, so m + p is even.
Therefore, we have proven that if m + n and n + p are even integers, where m, n and p
are integers, then m + p is even.

(b) Negation of the statement is “there exist s, t  Z with s  2 , and s | t and s | ( t + 1) ”.


If s | t , then t = as where a is integer.
If s | ( t + 1) , then t + 1 = bs where b is integer.
( t + 1) − t = bs − as
1 = s (b − a )
1
s=
b−a
1
Since a and b are integers, s = is a fraction means s < 2 which is contradict with
b−a
s  2.
It is not true that “there exist s, t  Z with s  2 , and s | t and s | ( t + 1) ”.
Therefore, we have proven that “If s, t  Z and s  2 , then s | t or s | ( t + 1) ”.

Level 1 Asia Pacific University of Technology and Innovation


AQ010-3-1-MCFC Final Exam-Marking Scheme Page 3 of 4

(c) The contrapositive of the statement is “If x is even, then x 2 − 6 x + 5 is odd.”


If x is even, x = 2i where i is some integers.
x 2 − 6 x + 5 = ( 2i ) − 6 ( 2i ) + 5 = 4i 2 − 12i + 5
2

= 2 ( 2i 2 − 6i + 2 ) + 1 = 2k + 1
Since i is integer, k = 2i 2 − 6i + 2 is integer also, hence x 2 − 6 x + 5 = 2k + 1 is odd.
Therefore, the contrapositive “If x is even, then x 2 − 6 x + 5 is odd.” is true.
We have proven that “If x 2 − 6 x + 5 is even, then x is odd”.

QUESTION 4 (20 Marks)

(a) (i)

(ii)
0 1 0 0 0 
0 0 1 0 0 
 
0 0 0 1 0 
 
0 0 0 0 1 
0 1 1 0 0 
(b) (i) deg(D) = 4, deg(E) = 4, deg(F) = 2, deg(G) = 2, deg(I) = 2
Since degree of all the vertices are even, hence Euler circuit exist and Euler path
does not exist.
(ii) Suggested answer: DEFEIGDFD
(iii) There is a subgraph can be obtained from Figure 2 with the 4 properties below:
(1) the subgraph contains all the 5 vertices of D, E, F, G and I.
(2) the subgraph is connected.
(3) the subgraph consists of equal number of vertices and edges i.e. 5 vertices
and 5 edges
(4) every vertex of the subgraph has degree 2
The subgraph is as below:

Hence, it is shown that the Hamilton circuit exists.


(c) Chromatic number = 3

Level 1 Asia Pacific University of Technology and Innovation


AQ010-3-1-MCFC Final Exam-Marking Scheme Page 4 of 4

Minimum number of meeting slots that can be scheduled is 3 slots.


(d) Suggested answer:

QUESTION 5 (20 Marks)

(a) It is not a tree because the graph is disconnected, and simple circuit exists in the graph.
(b) (i) (A) 5
(B) B
(C) D, E, F, I, J
(D) D, E, F, G, H
(ii) (A) A, B, D, E, I, J, F, C, G, K, H
(B) D, B, I, E, J, F, A, G, K, C, H
(c) Suggested answer:

(d) Suggested answer:

Level 1 Asia Pacific University of Technology and Innovation

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy