Question Bank-Unit 1

(Propositional Logic)
Bloom Diffi Competiti Area Topic U M
’s culty ve Exam n a
Questions CO Taxon Leve Question it r
omy l Y/N k
Level s

Which of these sentences are propositions? What are the truth values of those that 1 K1 L N 1 2
are propositions? a) 2 + 3 = 5. b ) Answer this question. (1/12/KR)

Determine whether these biconditionals are true or false. 1 K2 L N 1 2

a) 1 + 1 = 3 if and only if monkeys can fly. b) 0 > 1 if and only if 2 > 1.
(16/14/KR)

Determine whether each of these conditional statements is true or false. 1 K2 L N 1 2

a) If 1 + 1 = 2, then 2 + 2 = 5. b) If 1 + 1 = 3, then 2 + 2 = 4.
(17/14/KR)

State the converse, contrapositive, and inverse of the conditional statements. 1 K2 L N 1 2

If it snows today, I will ski tomorrow.
(27/15/KR)

State the converse, contrapositive, and inverse of each of these conditional 1 K2 M N 1 6

statements.
I come to class whenever there is going to be a quiz.
(27/15/KR)

Let P(x) denote the statement “x ≤ 4.” What are these truth values? 1 K2 L N 1 2
a) P(4) b) P(6) (1/53/KR)

.Let P(x) be the statement “x = x2.” If the domain consists of the integers, what are 1 K2 L N 1 2
these truth values?
a) P(0) b) ∀xP(x) (11/53/KR)
Determine the truth value of each of these statements if the domain consists of all 1 K2 L N 1 2
integers.
a) ∃n(n = −n) b) ∀n(3n ≤ 4n) (13/53/KR)

Let p, q, r denote the statements “It is raining”, “It is cold”, and “It is pleasant”, 1 K3 H Y 1 6
respectively. Then the statement “It is not raining and it is pleasant, and it is
not pleasant only if it is raining and it is cold” is represented by
(a) (￢p ∧ r ) ∧ (￢r → (p ∧ q)) (b) (￢p ∧ r ) ∧ ((p ∧ q) →￢r)
(c) (￢p ∧ r ) ∨ ((p ∧ q) →￢r) (d) (￢p ∧ r ) ∨ (r → (p ∧ q))
(GATE 2017, 1 mark)

Which one of the following is not equivalent to p↔q? 1 K2 M Y 1 2

(a) (￢p ∨ q ) ∧ (p ∨ ￢q) (b) (￢p ∨ q ) ∧ (q→ p)
(c) (￢p ∧ q ) ∨ (p ∧ ￢q) (d) (￢p ∧ ￢ q ) ∨ (p ∧ q)
(GATE 2015, 1 mark)

Let p, q, and r be propositions and the expression (p→q) →r be a contradiction. Then 1 K2 M Y 1 2

the expression (r→p) →q is
(a) a tautology (b) a contradiction
(c) always TRUE when p is FALSE (d) always TRUE when q is TRUE
(GATE 2017, 2 mark)

The statement (￢p) → (￢q ) is logically equivalent to : 1 Y 1 2

I. p → q II. q → p III. (￢q) ∨ p IV. (￢p) ∨ q

(a) I only (b) I and IV only
(c) II only (d) II and III only (GATE 2017, 1 mark)

Consider the following two statements: 1 K3 H Y 1 6

S1: If a candidate is known to be corrupt, then he will not be elected.
S2: If a candidate is kind, he will be elected.
Which one of the following statements follows from S1 and S2 as per
sound inference rules of logic?
(a) If a person is known to be corrupt, he is kind. (b) If a person is not known to be
corrupt, he is not kind.
(c) If a person is kind, he is not known to be corrupt. (d) If a person is not kind, he is
not known to be corrupt. (GATE2015,1)
Which one of the following well formed formula in predicate calculus is 1 K2 M Y 1 2
NOT valid?(a) (∀x p(x) →∀x q(x)) →(∃x ￢p(x) ∨ ∀x q(x)) (b) (∃x p(x)
∨∃x q(x)) →∃x (p(x) ∨ q(x)) (c) ∃x (p(x) ∧ q(x)) →(∃x p(x) ∧∃x q(x)) (d)
∀x( p(x) ∨ q(x)) →(∀x p(x) ∨ ∀x q(x)) (GATE 2016, 2 mark)

What is the logical translation of the following statements? “ None of my friends 1 K2 M Y 1 2

are perfect”
(a) ∃x(F(x) ∧￢P(x)) (b) ∃x(￢F(x) ∧ P(x))
(c) ∃x(￢F(x) ∧￢P(x)) (d) ￢∃x(F(x) ∧ P(x)) (GATE 2013, 2 mark)

Consider the statement:“ Not all that glitters is gold” 1 K2 M Y 1 2

Predicate glitters(x) is true if x glitters and predicate gold(x) is true if x is
gold.
Which one of the following logical formula represents the above
statement?
(a) ∀x:glitters(x) →￢gold(x) (b) ∀x: gold(x) → glitters(x)
(c) ∃x: gold(x) ∧￢glitters(x) (d) ∃x: glitters (x) ∧￢gold (x)
(GATE 2014, 1 mark)

Use De Morgan’s laws to find the negation of each of the following 1 K2 L N 1 6

statements. a) Jasbir is rich and happy b) Rajan will bicycle or run
tomorrow. (7/34/KR)

Show that each of these conditional statements is a tautology by using 1 K2 M 1 6

truth tables. (And then without using the truth tables.)
a) (p ∧ q) → p b) p → (p ∨ q) c) ￢p → (p → q) (9, 11/35/KR)

Show that (p → q) ∧ (q → r) → (p → r) is a tautology. (29/35/KR) 1 K2 M N 1 6

Show that two compound propositions are logically equivalent: 1 K2 L N 1 2

a) ￢(p ↔ q) and p ↔￢q b). ￢p ↔ q and p ↔￢q
c) ￢(p ↔ q) and ￢p ↔ q (17,19,21,23/35/KR)
Show that (p → q) → r and p → (q → r) are not logically equivalent. 1 K2 M N 1 6
(31/35/KR)

Determine whether each of these compound propositions is satisfiable. 1 K2 M N 1 6

a) (p ∨￢q) ∧ (￢p ∨ q) ∧ (￢p ∨￢q) b) (p → q) ∧ (p →￢q) ∧ (￢p
→ q) ∧ (￢p →￢q) c) (p ↔ q) ∧ (￢p ↔ q)
(61,62/36/KR)

Find the Disjunctive Normal Form (DNF) of (p ∨ q)→¬r. (31/35/KR) 1 K2 H N 1 6

Find the Disjunctive Normal Form (DNF) of p↔ (∼p ˅∼q). ). (Ex 1 K3 H N 1 6

4.27/4.25/SS)

Put the following into Conjunctive Normal form 1 K3 H N 1 6

.(42/35/KR)

Put the following into Conjunctive Normal form (p˅∼q)→q(Ex 4.27/4.25/SS) 1 K3 H N 1 6

Translate each of these statements into logical expressions using 1 K2 H N 1 6

predicates, quantifiers, and logical connectives. a) No one is perfect. b) Not
everyone is perfect. c) All your friends are perfect. d) At least one of your
friends is perfect. e) Everyone is your friend and is perfect. f ) Not
everybody is your friend or someone is not perfect. (25/54/KR)

Find the argument form for the following argument and determine whether 1 K2 H N 1 6
it is valid. Can we conclude that the conclusion is true if the premises are
true?
If Socrates is human, then Socrates is mortal.
Socrates is human.
∴ Socrates is mortal. (1/78/KR)

1 K2 H N 1 6
Consider the argument:
“If you invest in the stock market, then you will get rich”
“if you get rich, then you will be happy”
therefore” if you invest in the stock market, then you will be happy”
check whether the given argument is valid.
Use rules of inference to show that the hypotheses “Randy works hard,” 1 K2 M N 1 6
“If Randy works hard, then he is a dull boy,” and “If Randy is a dull
boy, then he will not get the job” imply the conclusion “Randy will not
get the job.” (5/78/KR)

For each of these arguments, explain which rules of inference are used 1 K2 M N 1 6
for each step: “Danish, a student in this class, knows how to write
programs in JAVA. Everyone who knows how to write programs in JAVA
can get a high-paying job. Therefore, someone in this class can get a high-
paying job.”

Determine whether each of these arguments is valid. If an 1 K2 M N 1 6

argument is correct, what rule of inference is being used? If it is
not, what logical error occurs?
a) If n is a real number such that n > 1, then n2 > 1. Suppose that n2
> 1. Then n > 1.
b) If n is a real number with n > 3, then n2 > 9. Suppose that n2 ≤ 9.
Then n ≤ 3.
c) If n is a real number with n > 2, then n2 > 4. Suppose that n ≤ 2.
Then n2 ≤ 4. (19/79/KR)

Check the following systems for consistency: 1 K2 M N 1 6

a) p→q,p→r,q→∼r,p (b) p→(q→r),q→(r→s),p∧q∧∼s

Test the validity of the following argument: All integers are 1 K3 H N 1 9

irrational numbers.Some integers are powers of 2.Therefore,some
irrational number is a power of 2.

Test the validity of the following argument: It is not the case that if 1 K3 H N 1 9
the price of petrol goes up,then the demand for two wheelers goes
down. It is not true that either an alternative source of energy will
be invented or the income of Indian Railways will not
increase..Therfore the demand for two wheelers will not go down
and the income of Indian Railways will increase.

Prove that if n is an integer and 3n+2 is odd, then n is odd. 1 K2 M N 1 6

(Ex3/76/KR)

Give a direct proof of the theorem “If n is an odd integer, then n2 is 1 K2 M N 1 6

odd.” (Ex1/75/KR)

Give a proof by contradiction of the theorem “If 3n+2 is odd, then n is 1 K2 M N 1 6

odd”. (Ex11/79/KR)

Translate these statements into English, where C(x) is “x is a 1 K2 H N 1 2

comedian” and F(x) is “x is funny” and the domain consists of all
people.
a) ∀x(C(x) → F(x)) b) ∀x(C(x) ∧ F(x))
c) ∃x(C(x) → F(x)) d) ∃x(C(x) ∧ F(x)) (7/53/KR)
 Practice Set – Unit-2
1. A particular brand of shirt comes in 12 colours, has a male version and a female version,
and comes in three sizes for each sex. How many different types of this shirt are made?

2. Suppose among 32 people who save paper or bottles (or both) for recycling, there are 30
who save paper and 14 who save bottles. Find the number m of people who:
a) save both;
b) save only paper;
c) save only bottles.

3. How many positive integers between 100 and 999 inclusive

a) are divisible by 7?
b) are odd?
c) have the same three decimal digits?
d) are not divisible by 4?
e) are divisible by 3 or 4?
f) are not divisible by either 3 or 4?
g) are divisible by 3 but not by 4?
h) are divisible by 3 and 4?

4. Consider all integers from 1 up to and including 100. Find the number of them that are:
a) odd or the square of an integer;
b) odd and the square of an integer.

5. Find the number of permutations that can be formed from all the letters of each word:
a) QUEUE;
b) COMMITTEE;
c) PROPOSITION;
d) BASEBALL.

6. Find the number m of ways that 7 people can arrange themselves:

a) In a row of chairs;
b) Around a circular table.

7. A history class contains 8 male students and 6 female students. Find the number of ways
that the class can elect:
a) 1 class representative;
b) 2 class representatives – 1 male and 1 female;

8. In a class of 30 students, 10 got A on the first test, 9 got A on a second test, and 15 did not
get an A on either test. Find: the number of students who got:
a) an A on both tests;
 b) an A on the first test but not the second;
c) an A on the second test but not the first.

9. A class contains 9 boys and 3 girls. Find the number of ways a teacher can select a
committee of 4 from the class where there is:
a) no restrictions;
b) 2 boys and 2 girls;
c) exactly one girl;
d) at least one girl.

10. How many license plates can be made using either two or three uppercase English letters
followed by either two or three digits?

11. A box contains 12 lightbulbs. Find the number n of ordered samples of size 3:
a) with replacement;
b) without replacement.

12. A student must take five classes from three areas of study. Numerous classes are offered
in each discipline, but the student cannot take more than two classes in any given area.
a) Using the pigeonhole principle, show that the student will take at least two classes in
one area.
b) Using the Inclusion–Exclusion Principle, show that the student will have to take at least
one class in each area.

13. A drawer contains a dozen brown socks and a dozen black socks, all unmatched. A man
takes socks out at random in the dark.
a) How many socks must he take out to be sure that he has at least two socks of the same
color?
b) How many socks must he take out to be sure that he has at least two black socks?

14. How many numbers must be selected from the set {1, 2, 3, 4, 5, 6} to guarantee that at
least one pair of these numbers add up to 7?

15. How many numbers must be selected from the set {1, 3, 5, 7, 9, 11, 13, 15} to guarantee
that at least one pair of these numbers add up to 16?
 Practice Set – Unit-3
1. Find power set of X = {φ, 1, {1,2}, {1,2,3}}

̅̅̅̅̅̅̅
2. Use Venn diagrams to show that (𝐴 ⋂ 𝐵 ) = 𝐴̅ ⋃ 𝐵̅ & (𝐴 𝑈 𝐵 𝑈 𝐶)’ = 𝐴’ ∩ 𝐵’ ∩ 𝐶’

3. List the ordered pairs in the relation R from A = {1,2,3,4,5,6,7,8,9,10} to

B={5,6,7,8,9,10,11,12}, where (a,b) ϵ R if and only if
(a) b-a = 5
(b) a divides b
(c) gcd(a,b) = 2

4. Give an example of a relation which is:

(a) reflexive but neither symmetric nor transitive;
(b) symmetric but neither reflexive nor transitive;
(c) transitive but neither reflexive nor symmetric;
(d) reflexive and symmetric but not transitive;
(e) reflexive and transitive but not symmetric;
(f) symmetric and transitive but not reflexive.

5. Show that the relation R defined on the set ℝ of real numbers as

R = {(a, b) : a ≤ b2}
is neither reflexive nor symmetric nor transitive.

6. Let S = {1,2,3,4,5,6,7,8,9,10}. Determine whether each of the following is a partition of S.

Explain.
(a) P1 = {{1,2,3,7}, {1,4,5,6}, {8,9,10}};
(b) P2 = {{1,2}, {3,5,6}, {7,8,9,10}};
(c) P3 = {{1,3,5,7,9}, {2,4}, {6}, {8,10}}.

7. Let R be the following equivalence relation on the set A = {a,b,c,d,e,f}:

R={(a,a),(a,b),(b,a),(b,b),(c,c),(c,e),(c,f),(d,d),(e,c),(e,e),(e,f),(f,c),(f,e),(f,f)}.
Determine the equivalence classes of A and thus find the partition of A using equivalence
classes of R.

8. Let R be the relation defined on the set ℤ of integers as follows: for integers a and b,
aRb if and only if a≡b (mod 3),
that is, aRb if 3 divides (a-b).
(a) Show that R is an equivalence relation on ℤ.
(b) What are the equivalence classes of R?

9. How many relations are there on a set with n elements? How many reflexive relations are
there on a set with n elements?
10. Let R = {(a,d),(a,e),(b,c),(b,d),(c,a),(c,c),(d,e)} and S = {(b,a),(c,a),(d,b),(e,c)} be relations
defined on {a,b,c,d,e}.
(a) Find S∘R and R∘S.
(b) Find R-1 and S-1.
(c) Show that (S∘R)-1 = R-1∘S-1.

11. Let A = {1,2,3,4,5}, B={1,2,3,…,100}. Determine which of the following relations from A to
B are functions:
(a) R={(1,1), (2,1), (3,1), (4,1), (5,1)}
(b) R={(1,1), (1,2), (1,3), (1,4), (1,5)}
(c) (a,b) ∈ R if b=a2.
(d) (a,b) ∈ R if a2=b.

12. In each of the following cases, state whether the function is one-one, onto, or bijective.
Justify your answer.
(a) f: ℝ → ℝ defined by f(x) = 3 – 4x;
(b) g: ℝ → ℝ defined by f(x) = 1 + x2.

13. In the above question, determine the composition functions f∘g and g∘f. Moreover, in
case the function is bijective, find its inverse.

14. Consider functions f and g such that composite g∘f is defined and is one-one. Are f and g
both necessarily one-one? Are f and g both necessarily onto, if g∘f is onto?

4𝑥+3 2 2
15. If f(𝑥) = 6𝑥+4 , 𝑥 ≠ 3, show that f ∘ f(x) = x for all ≠ . What is the inverse of f?
3

16. Show that the set of even integers is countable.

17. Show that the set of real numbers is an uncountable set.

18. Use the Principle of Mathematical Induction to show that 4n – 1 is divisible by 3, for each
natural number n.

19. Prove that number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.

20. Show that n2 < 2n for all natural numbers n ≥ 5.

21. Use Principle of Strong Induction to show that if n is an integer greater than 1, then n can
be written as the product of primes.

22. Express each number as a product of its prime factors:

(a) 140
 (b) 3825
(c) 5005
(d) 7429

23. Use the fundamental theorem of arithmetic to show that the numbers 4n, where n is a
natural number, do not end with the digit zero.

24. Use Euclid’s algorithm to find the greatest common divisor:

(a) 64 and 168
(b) 42 and 234
(c) 1001 and 1441