DISCRETE

MATHEMATICS
ASSIGNMENT

Name : Sohom Ghorai

Regd . No : 190301120001
B.Tech CSE , 3rd Sem
CUTM , BBSR

Sohom ghorai || 190301120001 1

 Assignment-I (Module-I)

1. Define connectives; write the truth values rules and the respective Truth Tables.

Ans: The words or phrases or symbols which are used to make a proposition by two or more
propositions are called connectives.
(a) Negation: If p denotes a statement then the negation of p is written as ¬p. If the truth value of p
is T, then the truth value of ¬p is F. Also, if the truth value of p is F then the truth value of ¬p is
T.
Truth table for negation

P ~P

T F

F T

(b) Conjunction: The conjunction of two statements (or propositions) p and q is the statement p ∧ q.
The statement p ∧ q has the truth value T whenever both p and q have the truth value T.
Otherwise it has truth value F.

Truth table for conjunction

p q p^q

T T T
T F F
F T F
F F F

(c) Disjunction: The disjunction of two statements p and q is the statement p ∨ q. The statement p ∨ q has
the truth value F only when both p and q have the truth value F. Otherwise it has truth value T.

Truth table for disjunction

p q p∨q

T T T
T F T
F T T
F F F

Sohom ghorai || 190301120001 2

 (d) Conditional proposition:The statement p → q has a truth value F, when q has truth value F and p has
truth value T, otherwise it has the truth value T.

Truth table for conditional proposition

p q p→ q

T T T
T F F
F T T
F F T

(e) Exclusive or:The exclusive or of p and is the proposition that is true when exactly one of p and q is true
and is false otherwise.

Truth table for exclusive or

p q p q

T T F
T F T
F T T
F F F

2. Define Converse, Inverse and contra positive with examples and Truth Tables.
What is the contra positive, the converse, and the inverse of the conditional statement “The home
team wins whenever it is raining”?
Ans: If P → Q is a conditional statement, then the proposition Q → P is called its converse.
Truth table for Q → P

P Q Q→P

T T T
T F T
F T F
F F T

Sohom ghorai || 190301120001 3

 The proposition ¬P → ¬Q is called inverse.

Truth table for ¬P → ¬Q

P Q ¬P ¬Q ¬P → ¬Q

T T F F T
T F T T T
F T T F F
F F T T T

The proposition ¬Q → ¬P is called its contra positive.

Truth table for ¬Q → ¬P

P Q ¬Q ¬P ¬Q→ ¬P

T T F F T
T F T F F
F T F T T
F F T T T

Statement: The home team wins whenever it is raining.

Converse: If the home team wins then it is raining.
Inverse: If it is not raining then the home team does not win.
Contrapositive: If the home team does not win then it is not raining.

3. Define Tautology, contradiction, contingency with examples and Truth Tables.

Ans:
(a) Tautology: A statement formula which is true regardless of the truth values of the statements which replace
the variables in it is called a tautology.
TRUTH TABLE OF (P V ~P)

P ~P P V ~P
T F T
F T T

(b) Contradiction: A statement formula which is false regardless of the truth values of the statements which
replace the variables in it is said to be a contradiction.

Sohom ghorai || 190301120001 4

 TRUTH TABLE OF (P ^ ~P)

P ~P P ^ ~P

T F F

F T F

(c) Contingency: A statement formula which is neither a tautology nor a contradiction is known as a contingency.

TRUTH TABLE OF (P  Q)

P Q PQ

T T F
T F T
F T T
F F F

(p∨¬q) → (p ∧q), P → (Q →R)

4. Construct the truth table of the compound proposition

Ans: (p ∨ ¬q) → (p ∧q)

p q ¬q p∨¬q p ∧q (p∨¬q) → (p ∧q)

T T F T T T

T F T T F F

F T F F F T

F F T T F T

Sohom ghorai || 190301120001 5

 P
T Q
T R
T T
Q →R T
P → (Q →R)
T T F F F
P → (Q T F T T T →R)
T F F T T
F T T T T
F T F F T
F F T T T
F F F T T

5. Define Logically equivalent and write the equivalence formulae.

Ans: The compound propositions P and Q are called logically equivalent if P↔Q is a tautology. The notation P 
Q denotes that p and q are logically equivalent.
Two formulas A and B are said to equivalent to each other if and only if A↔ B is a tautology.

If A↔B is a tautology, we write A ⇔ B which is read as A is equivalent to B.

6. Show that ~(P →Q) and P ^ ~Q are logically equivalent, and ( P → Q) V (P → R) and
P →(Q V R) are logically equivalent.

Ans: ~(P →Q) and P ^ ~Q

Consider ~(P →Q) ≡ ~( ~P V Q)

≡ ~( ~P) ^ (~ Q)
≡P^~Q

(P → Q) V (P → R) and P →(Q V R)
Consider ( P → Q) V (P → R) ≡ (7P V Q) V (7P V R)
≡ 7P V Q V 7 P V R
≡ 7P V 7P V Q V R

Sohom ghorai || 190301120001 6

 ≡ ( 7P V 7P) V Q V R
≡ 7P V (Q V R)
≡ P →(Q V R)

7. Show that ( P ^ Q) → (P V Q) is a Tautology.

Ans:
P Q P^Q PVQ ( P ^ Q) → (P V Q)
T T T T T
T F F T T
F T F T T
F F F F T

8. Write the negation of the following statements.

(a)Jan will take a job in industry or go to graduate school.

Ans:Jan will not take a job in industry and will not go to graduate school.

(b) James will bicycle or run tomorrow.

Ans: James will not bicycle and not run tomorrow.

(c ) If the processor is fast then the printer is slow.

Ans: If processor is not fast then the printer is not slow.

9. Write the dual of the following formulas:

(a) (P∨Q) ∧R

Ans: (P∧Q) ∨R

(b) (P∧Q) ∨T

Ans: (P ∨ Q) ∧ T

(c ) (P∧Q) ∨ (P∨¬(Q∧¬S))

Ans: (P ∨ Q) ∧ (P ∧ ¬(Q ∨ ¬S))

Sohom ghorai || 190301120001 7