Section A:: Problem 1

SECTION A:
Problem 1
i. Check the validity of the following argument:
If you are a chef, then you work in the hotel. If you don’t like cheese, then you don’t work
in the hotel. Therefore, if you are chef, then you like cheese.
Solution:
Let us consider,
you are a chef = p
you work in hotel = q
you don’t like cheese = r
then,
you don’t work in hotel = ¬q
you don’t like cheese = ¬r
according to question,
p → q, r→¬q ├ p →¬r
Now, writing above arguments in mathematical form, we get,
X = [( p→ q) ∧ (r→¬q)] → (p→¬r)
So, if the above argument is valid we need prove that
X = [( p→ q) ∧ (r→¬q)] → (p→¬r) is tautology using truth table

Truth table
p q r ¬q ¬r p→ q r→¬q [(p→q)∧ (r→¬q)] (p→¬r) X

T T T F F T F F F T
T T F F T T T T T T
T F T T F F T F F T
T F F T T F T F T T
F T T F F T F F T T
F T F F T T T T T T
F F T T F T T T T T
F F F T T T T T T T
Is tautology
hence, from truth table it is prove that X = [( p→ q) ∧ (r→¬q)] → (p→¬r) is tautology. So,
the given argument is valid.
ii. Explain, without using a truth table, why (p ∨￢q) ∧(q ∨￢r) ∧(r ∨￢p) is true when p, q,
and r have the same truth value and it is false otherwise.
Ans:
There are three individual propositions for this compound proposition. Rather significant
is that p, q and r appear within each respectively. Furthermore the negation of p, q and r
appear within respectively such as:
(p ∨￢q) ∧(q ∨￢r) ∧(r ∨￢p)
Due to the ∨(disjunction) within each proposition having the same truth value ensures that
at least one of the propositional variables within the individual proposition will be true
i.e.
(p ∨￢q) = (T ∨ F) = T
(q ∨￢r) = (T ∨ F) = T
(r ∨￢p) = (T ∨ F) = T
And
T ∧ T∧ T = T
Thus, the compound proposition will be true if p, q and r have same truth value. However,
if even one of the propositional variables has a different truth value than the other two,
the compound proposition become false.
Problem 2
i. Design a circuit using the 3 steps of circuit design for the following truth table:
A B C X
1 1 1 1
1 1 0 1
1 0 1 1
1 0 0 0
0 1 1 1
0 1 0 0
0 0 1 0
0 0 0 0
Solution:
Step: 1
There is a 1 in lines 1, 2, 3 and 5 of the output column. The sub-expressions which will
return 1 in these lines are, respectively ABC, ABC’, AB’C and A’BC
The Boolean Expression is therefore,
X = (ABC) + (ABC’) + (AB’C) + (A’BC)
Step: 2
Simplifying the Boolean Expression we get,
X = (ABC) + (ABC’) + (AB’C) + (A’BC)
Applying idempotent law we get,
ABC + ABC’ + AB’C + ABC + A’BC + ABC

AB (C + C’) + AC (B’+ B) + BC (A’ + A)
Applying Complement law we get,
AB (1) + AC (1) + BC (1)
Applying Identity law we get,
AB + AC + BC
Step: 3
Figure 1: Circuit
ii. Build a digital circuit that produces the output (p ∨￢r) ∧(￢p ∨(q ∨￢r)) when given
input bits p, q, and r. Also, construct the truth table.
Ans:
The digital circuit that produces the output (p ∨￢r) ∧ (￢p ∨ (q ∨￢r)) when given input
bits p, q, and r is shown below:
The truth table of X = (p ∨￢r) ∧ (￢p ∨ (q ∨￢r)) is
p q r ￢p ￢r p ∨￢r q ∨￢r (￢p ∨ (q ∨￢r) X

1 1 1 0 0 1 1 1 1
1 1 0 0 1 1 1 1 1
1 0 1 0 0 1 0 0 0
1 0 0 0 1 1 1 1 1
0 1 1 1 0 1 1 1 0
0 1 0 1 1 1 1 1 1
0 0 1 1 0 1 0 1 0
0 0 0 1 1 1 1 1 1
Problem 3
i) State De-Morgan’s Law.
Use the given information to complete a Venn diagram, then determine:
a) how many students have seen exactly one of these movies?
b) how many have seen only Star Wars?
18 had seen The Matrix 24 had seen Star Wars

20 had seen Lord of the Rings 10 had seen Matrix and Star Wars
6 had seen all three 14 had seen Lord of the Ring and
Star Wars
12 had seen Matrix and Lord of
the Rings
Ans:
De-Morgan laws state that the complement of the union of two sets is equal to the
intersection of their complements and the complement of the intersection of two sets is
equal to the union of their complements.
For any two finite sets A and B;
(A U B)' = A' ∩ B' (which is a De Morgan's law of union).
(A ∩ B)' = A' U B' (which is a De Morgan's law of intersection).
Solution
Given,
No. of students who had seen Matrix n(M) = 18
No. of students who had seen Star Wars n(S) = 24
No. of students who had seen Lord of the Rings n(L) = 20

Then,
n(M ∩ S) = 10
n(S ∩ L) = 14
n(M ∩ L) = 12
n(M ∩ S ∩ L) = 6
Representing above information in venn diagram we get,

Section A:: Problem 1

Uploaded by

Copyright:

Available Formats

Section A:: Problem 1

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Section A:: Problem 1

Uploaded by

Copyright:

Available Formats

SECTION A:

you are a chef = p

you work in hotel = q

you don’t like cheese = r

you don’t work in hotel = ¬q

you don’t like cheese = ¬r

Now, writing above arguments in mathematical form, we get,

So, if the above argument is valid we need prove that

X = [( p→ q) ∧ (r→¬q)] → (p→¬r) is tautology using truth table

p q r ¬q ¬r p→ q r→¬q [(p→q)∧ (r→¬q)] (p→¬r) X

(p ∨￢q) ∧(q ∨￢r) ∧(r ∨￢p)

The Boolean Expression is therefore,

X = (ABC) + (ABC’) + (AB’C) + (A’BC)

Simplifying the Boolean Expression we get,

X = (ABC) + (ABC’) + (AB’C) + (A’BC)

Applying idempotent law we get,

ABC + ABC’ + AB’C + ABC + A’BC + ABC

Applying Complement law we get,

AB (1) + AC (1) + BC (1)

Applying Identity law we get,

AB + AC + BC

The truth table of X = (p ∨￢r) ∧ (￢p ∨ (q ∨￢r)) is

p q r ￢p ￢r p ∨￢r q ∨￢r (￢p ∨ (q ∨￢r) X

Use the given information to complete a Venn diagram, then determine:

a) how many students have seen exactly one of these movies?

b) how many have seen only Star Wars?

18 had seen The Matrix 24 had seen Star Wars

For any two finite sets A and B;

(A U B)' = A' ∩ B' (which is a De Morgan's law of union).

(A ∩ B)' = A' U B' (which is a De Morgan's law of intersection).

No. of students who had seen Matrix n(M) = 18

No. of students who had seen Star Wars n(S) = 24

No. of students who had seen Lord of the Rings n(L) = 20

Representing above information in venn diagram we get,

You might also like