# Thread: mth202 discrete mathmatics second assignment solution fall 2010

1. ## mth202 discrete mathmatics second assignment solution fall 2010

Maximum Marks: 15
Due Date: November 22, 2010

DON’T MISS THESE: Important instructions before attempting the solution of this assignment:
• To solve this assignment, you should have good command over 9 - 15 lectures.

• Try to get the concepts, consolidate your concepts and ideas from these questions which you learn in the 9 to 15 lectures.

• Upload assignments properly through LMS, No Assignment will be accepted through email.

• Don’t use colorful back grounds in your solution files.
• Use Math Type or Equation Editor etc for mathematical symbols.
• You should remember that if we found the solution files of some students are same or copied from any website then we will reward zero marks to all those students.
• Try to make solution by yourself and protect your work from other students, otherwise you and the student who send same solution file as you will be given zero marks.
• Also remember that you are supposed to submit your assignment in Word format any other like scan images etc will not be accepted and we will give zero marks correspond to these assignments.

Question 1)Prove that (Bc È (Bc – A)) c = (Bc È (Bc Ç Ac)) c by using Membership Table.
Question 2)Let A= {0, 1, 2} be a set, construct A´A and determine weather R = A´A is partially ordered relation, justify your answer.
(Hint: check each condition Reflexive, Anti-symmetric and Transitive)

solution will be updated soon.

2. ## mth202 final solution assignment 2

First question:

Let A= {0, 1, 2} so we can determined A×A as under
{(0,0), (0,1), (0, 2), (1,0), (1,1), (1, 2), A× A = (2,0), (2,1), (2,2)}
Here R = A×A so R = {(0,0), (0,1), (0,2), (1,0), (1,1), (1, 2), (2,0), (2,1), (2,2)}
For Reflexive:
R is reflexive if and only if, for all aÎ A , (a,a)ÎR
A= {0, 1, 2}
A× A = {(0,0), (0,1), (0, 2), (1,0), (1,1), (1, 2), (2,0), (2,1), (2,2)}
R = {(0,0), (0,1), (0,2), (1,0), (1,1), (1, 2), (2,0), (2,1), (2,2)}
We can see that {(0,0), (1,1), (2, 2)}ÎR so R is Reflexive
For Anti-symmetric:
R is anti-symmetric if and only if, for all bÎ A if
(a,b)ÎR and (b, a)ÎR then a = b
aRb and bRa then a = b
A= {0, 1, 2}
A× A = {(0,0), (0,1), (0, 2), (1,0), (1,1), (1, 2), (2,0), (2,1), (2,2)}
R = {(0,0), (0,1), (0,2), (1,0), (1,1), (1, 2), (2,0), (2,1), (2,2)}
We can see that {(0,0), (0,1), (0,2), (1,0), (1,1), (1, 2), (2,0), (2,1), (2,2)}
As we can see that,
(0,1)ÎR and (1,0)ÎR then 0=0 [As a = b]
(2,1)ÎR and (1, 2)ÎR then 2=2 [As a = b]
all pairs are available such that (a,b)ÎR and (b, a)ÎR so R is Anti-symmetric
For Transitive:
R is transitive if and only if, for all a,b, cÎ A if
(a,b)ÎR and (b, c)ÎR then (a, c)ÎR
That is aRb and bRc then aRc
A= {0, 1, 2}
A× A = {(0,0), (0,1), (0, 2), (1,0), (1,1), (1, 2), (2,0), (2,1), (2,2)}
R = {(0,0), (0,1), (0,2), (1,0), (1,1), (1, 2), (2,0), (2,1), (2,2)}
As we can see
(0, 2)ÎR and (2,1)ÎR then (1,0)ÎR
(0,1)ÎR and (1, 2)ÎR then (0, 2)ÎR and so on…….
all pairs are available such that (a,b)ÎR and (b, c)ÎR then (a, c)ÎR so R is Transitive