retagged by
3,645 views

4 Answers

Best answer
15 votes
15 votes

A.    $R \cap S = ( R \cup S) - [(R-S) \cup (S-R)]$

{ 2 } = { 1 , 2 , 3 } - [ {1} ∪ {3} ]

{ 2 } = { 2 }

B.   $R \cup S = ( R \cap S) - [(R-S) \cup (S-R)]$

{ 1 , 2 , 3}   { 2 } - [ 1,3 ]

C.    $R \cap S = ( R \cup S) - [(R-S) \cap (S-R)]$

{ 2 }   { 1 , 2 , 3 } - [ 1 ∩ 3 ]

D.    $R \cap S = ( R \cup S) \cup (R-S)$

{ 2 } =  { 1 , 2 , 3 } ∪{1}

{ 2 }   { 1 , 2 , 3 }

Hence.Option(A)  $R \cap S = ( R \cup S) - [(R-S) \cup (S-R)]$ is the correct choice.

selected by
1 votes
1 votes
option A is correct simply draw venn diagrams with two sets R and S having some part in common

R intersection S will be =R union S (which cover all area of R and S)-(symmetric difference R-S union symmetric diff S-R)
1 votes
1 votes
Set Theory Formula:

$A - B = A\bigcap B{}' = A.B'$

With this formula

Option a becomes:

$(R + S) - [RS' + SR'] =(R + S)[RS' + SR']'

=(R + S)(R' + S)(S' + R)

=[R + (S.S')](R' + S)

=[R + 0](R' + S)

=R(R' + S)

=RS =R \cap S =LHS$
Answer:

Related questions

3 votes
3 votes
2 answers
2
go_editor asked Jun 24, 2016
3,729 views
Logic family popular for low power dissipationCMOSECLTTLDTL
6 votes
6 votes
4 answers
3
go_editor asked Jun 24, 2016
4,357 views
A problem whose language is recursion is called?Unified problemBoolean functionRecursive problemDecidable
7 votes
7 votes
3 answers
4
go_editor asked Jun 24, 2016
6,183 views
A symbol table of length $152$ is processing $25$ entries at any instant. What is occupation density?$0.164$$127$$8.06$$6.08$