Scribd
Upload
27 views2 pages

DSGT Logic Questions

Uploaded by

mujeeransari96
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
27 views2 pages

DSGT Logic Questions

Uploaded by

mujeeransari96
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/ 2

UNIT 1: Logic

SYLLABUS:

1.1 Propositional Logic, Predicate Logic, Laws of Logic, Quantifiers, Normal Forms, Inference Theory of
Predicate Calculus, Mathematical Induction

MATHEMATICAL INDUCTION

A. 1. Prove by mathematical induction that 6𝑛+2 + 72𝑛+1 is divisible by 43 for each positive
integer 𝑛.
2. Use induction to prove that: 7𝑛 − 1 is divisible by 6 for 𝑛 = 1,2,3, ...
3. Show that 𝑛(𝑛2 − 1) is divisible by 24, where 𝑛 is any odd positive integer.
4. Prove that 8𝑛 − 3𝑛 is a multiple of 5 by mathematical induction 𝑛 ≥ 1.

B. 1. By using mathematical Induction, prove that, 1 + 𝑎 + 𝑎2 + ⋯ + 𝑎𝑛 =


1−𝑎𝑛+1
, where 𝑛 ≥ 0
1−𝑎
2. Prove that, 1.1! + 2.2! + 3.3! + ⋯ 𝑛. 𝑛! = (𝑛 + 1)! − 1, where 𝑛 is a positive integer.
3. Prove that following by mathematical induction: 2 + 5 + 8 + ⋯ + (3𝑛 − 1) = 𝑛(3𝑛 + 1)/2
𝑛(2𝑛−1)(2𝑛+1)
4. Show that 12 + 32 + 52 + ⋯ + (2𝑛 − 1)2 =
3
𝑛(𝑛+1)(2𝑛+1)
5. Prove by Mathematical induction method 12 + 22 + 32 + ⋯ … + 𝑛2 =
6

LOGIC

C. 1. Prove ∼ (𝑝 ∨ (∼ 𝑝 ∧ 𝑞)) and ∼ 𝑝 ∧∼ 𝑞 are logically equivalent by developing a series of


logical equivalences.
2. Prove that disjunction distributes over conjunction that is prove that is prove the
distributive law. (𝑝 ∨ 𝑞 ∧ 𝑟) ≡ (𝑝 ∨ 𝑞) ∧ (𝑝 ∨ 𝑟)
3. 𝑝 ∧ (𝑞 ∨ 𝑟) and (𝑝 ∧ 𝑞) ∨ (𝑝 ∧ 𝑟) are logically equivalent. (Distributivity)
4. Show that, (∼ 𝑃 ∧ (∼ 𝑄 ∧ 𝑅)) ∨ (𝑄 ∧ 𝑅) ∨ (𝑃 ∧ 𝑅) ↔ 𝑅

5. 1. Prove that (Use laws of logic) ((𝑃 ∨ 𝑄) ∧∼ (∼ 𝑃 ∧ (∼ 𝑄 ∨∼ 𝑅)) ∨ (∼ 𝑃 ∧∼ 𝑄) ∨ (∼ 𝑃 ∧∼


𝑅) is tautology.
2. Show that the following statement is tautological. (𝑝 ∧ (𝑝 → 𝑞)) → 𝑞.
3. Prove by laws of logic (do not use truth table) that the following statement is a
tautology.
((𝑝 ⇒ 𝑞 ) ∧ (𝑞 ⇒ 𝑟)) ⇒ (𝑝 ⇒ 𝑟)
4. Show that (¬𝑞 ∧ (𝑝 ⇒ 𝑞)) ⇒ ¬𝑝 is a tautology.
5. Construct truth table to determine whether the given statement is a tautology,
contradiction or neither :
(i) (𝑞 ∧ 𝑝) ∨ (𝑞 ∧∼ 𝑝)
(ii) (𝑝 ∨∼ 𝑞 ) ∧ 𝑝
6. Compute the truth table of the statement, (𝑝 → 𝑞) ↔ (∼ 𝑞 →∼ 𝑝). Is this statement a
tautology ?
7. Show that (𝑝 → 𝑞) ∧∼ 𝑞 →∼ 𝑝 is a tautology.

6. 1. State the converse, inverse and contrapositive of the following.


(i) If it is cold then he wears hat.
(ii) If integer is a multiple of 2, then it is even
2. Translate into symbolic form
a. If I play football, I cannot study.
b. Either I play football or I can pass DBMS.
c. I played football, therefore I passed DBMS.
3. Write the following statements in symbolic form :
(i) Indians will win the world cup if their fielding improves.
(ii) If I am not in a good mood or I am not busy, then I will go for a movie.
(iii) If you know object oriented programming and oracle, then you will get a job.
(iv) I will score good marks in the exam if and only if I study hard.
4. Using the following statements:
p: I will study discrete structures.
q: I will go to a movie.
𝑟 : I am in a good mood.
Write the following statements in symbolic form:
(i) If I am not in a good mood, then I will go to a movie.
(ii) I will not go to a movie and I will study discrete structures.
(iii) I will go to a movie only if I will not study discrete structures.
(iv) I will not study discrete structures, then I am not in a good mood.

7. 1. Define & explain :


a. Quantifiers
b. Existential quantifier
c. Universal quantifier
2. Write the following two propositions in symbols.
(i) 'For every number 𝑥 there is a number 𝑦 such that 𝑦 = 𝑥 + 1.'
(ii) There is a number 𝑦 such that, for every number 𝑥, 𝑦 = 𝑥 + 1:
3. Write the following statements in symbolic form, using quantifiers.
(i) All students have taken a course in communication skills.
(ii) There is a girt student in the class who is also a sports person.
(iii) Some students are intelligent, but not hard working.
4. What is an universal and Existential Quantifier? Translate the following symbols into
English.
(i) ∀ × 𝑃(𝑥)
(ii) ∃𝑥𝑃(𝑥)
(iii)∀(𝑥)(∼ 𝑃(𝑥))
5. Find the CNF and DNF for the following:
(i) (𝑝 ∨ 𝑞‾ ) → 𝑞
(ii) 𝑝 ↔ (𝑝‾ ∨ 𝑞‾ )
(iii) 𝑝 → [(𝑝 → 𝑞) ∧ (𝑞 ′ ∨ 𝑝′ )]

NOTE:
1. THIS CHAPTER CARRIES MINIMUM OF 10 MARKS.
CLICK HERE FOR SOLUTION PART

You might also like