SHREE SWAMI ATMANAND SARSWATI INSTITUTE OF TECHNOLOGY, SURAT

Branch: Computer-22
Subject Name: DM Date: 31/12/2024
Tutorial-2
1. Which of these sentence are propositions? What are the truth values of those that are
proposition?
a) 9 < 12 e) 5 ∈ {1,5,3} h) (√30 > 5) ∧ (√30 > 7) l) 𝑢 is vowel
b) 𝑥 + 2 = 12 f)∅ ⊆ {3} i) (4 ∈ N) ∨ (5 ∈ 3Z) 1
m) 3 ∈ Q
c) 2 is a prime number g)−4 ∈ N j) 𝑥 + 4 = 6 𝑤ℎ𝑒𝑛 𝑥 = 2 n) −18 ∈ 3Z
d) Answer this question k) What a beautiful drawing!
2. Translate the following in words(statement):
Let P: high speed driving is dangerous , Q: Rajesh was a wise man.
(1) 𝑝 ∧ 𝑞 (2) ~𝑝 ∧ 𝑞 (3) ~ (𝑝 ∧ 𝑞)
3. Translate into symbolic form.
1. Let P: she studies. and Q: she will pass in exam.
a. she studies or she will pass in exam.
a. She does not study but she will pass in exam.
b. Sufficient condition for she studies that she will pass in exam.
c. A necessary condition for she studies that she will pass in exam.
d. A necessary and sufficient condition for she studies that she will pass in exam.
2. Let P: He is tall and Q: He is smart.
a. It is false that he is short or smart.
b. He is tall or he is short and smart.
c. It is not true that he is short or not smart.
3. If p: product is good, q: service is good, r: company is public limited
a. Either product is good or the service is good or both
b. Either the product is good or service is good but not both
c. It is not the case that both product is good and company is public limited.
4. If 𝑝 → 𝑞 is false, find the truth values of ~ (𝑝 ∧ 𝑞) → 𝑞.
5. If p and q are false, find the truth value of (𝑝 ∨ 𝑞) ∧ (~ 𝑝 ∨ ~ 𝑞).
6. Given the truth values of p and q as T and that r and s as F, Find the truth values of the
a. 𝑝 ∨ (𝑞 ∧ 𝑟)
b. 𝑝 → (𝑟 ∧ 𝑠)
c. (𝑝 ∧ (𝑞 ∧ 𝑟)) ∨ ~((𝑝 ∨ 𝑞) ∧ (𝑟 ∨ 𝑠))
7. Find if the following is a tautology, contradiction or contingency.
a. (𝑝 → (𝑞 → 𝑟)) → ((𝑝 → 𝑞) → (𝑝 → 𝑟)) Ans: Tautology
b. (𝑞 ∧ 𝑝) ∨ (𝑞 ∧ ~ 𝑝) Ans: contingency
c. (𝑝 ∧ (~ 𝑝 ∨ 𝑞 )) ∧ ~ 𝑞 Ans: contradiction
8. Prove the following:
1. (𝑝 ∨ 𝑞) ∧ ∼ 𝑝 ≡ ∼ 𝑝 ∧ 𝑞
2. ∼ (𝑝 ∧ 𝑞) ≡ ∼ 𝑝 ∨ ∼ 𝑞.
3. ∼ (𝑝 ∨ 𝑞 ∨ 𝑟) ≡ ∼ 𝑝 ∧ ∼ 𝑞 ∧ ∼ 𝑟
Hint: Prove that the statement is logically equivalent.
9. Find out using truth table, whether the following statements are tautology and logically
imply or not.
(i) (𝑝 ∧ 𝑟) → 𝑝
(ii) (𝑝 ∧ 𝑞) → (𝑝 ∨ 𝑞)
(iii) ((𝑝 → 𝑞) ∧ (𝑞 → 𝑟)) → (𝑝 → 𝑟)
10. Express the contrapositive, converse, inverse and negation forms of the following
statement.
a. ‘If x is rational, then x is real.’
𝜋
b. ‘If 3 < b and 1 + 1= 2, then sin = 1/2.’
3
11. Prove the associative law: (𝑝 ∧ 𝑞) ∧ r ≡ 𝑝 ∧ (𝑞 ∧ r).
12. Suppose that the universal set is 𝑈 = {1,2,3,4,5,6,7,8,9,10}. Express each of these sets with bit
strings where the ith bit in the string is 1 if I is in the set and 0 otherwise.
a){3,4,5} b) {1,3,6,10} c) {2,3,4,7,8,9}
13. Suppose that the universal set is 𝑈 = {1,2,3,4,5,6,7,8,9,10}. Find the set specified by each of
these bit strings.
a) 11 1100 1111 b) 01 0111 1000 c)10 0000 0001
14. The bit strings for the sets {1,2,3,4,5} and {1,3,5,7,9} are 11 1110 0000 and 10 1010 1010
respectively. Use bit strings to find the union and intersection of these sets.
15. A function 𝑓: ℝ+ → ℝ is defined by𝑓(𝑥) = 𝑥 2 − 8. Check whether 𝑓 is one-one and onto.
1
16. Show that the functions 𝑓(𝑥) = 𝑥 4 and 𝑔(𝑥) = 𝑥 4 for 𝑥 ∈ ℝ are inverses of one another.
17. Let 𝑌 = {𝑛2 : 𝑛 ∈ 𝑁} and 𝑓: 𝑁 → 𝑌 defined as𝑓(𝑛) = 𝑛2. Show that 𝑓 is invertible and find
the inverse of 𝑓
18. Let 𝑓: 𝑅 → 𝑅 be function defined by𝑓(𝑥) = 𝑎𝑥 + 𝑏. Find values of 𝑎 and 𝑏 for which 𝑓 ∘
𝑓 = 𝐼𝑅 .
19. Define one-one function. Show that the function 𝑓: 𝑅 → 𝑅, 𝑓(𝑥) = 3𝑥 − 7 is one- one and
onto both. Also find its inverse.
20. Find the composition of two functions 𝑓(𝑥) = 𝑒 𝑥 and 𝑔(𝑥) = 𝑥 3 , (𝑓 ∘ 𝑔)(𝑥) and (𝑔 ∘ 𝑓)(𝑥).
Hence, show that (𝑓 ∘ 𝑔)(𝑥) ≠ (𝑔 ∘ 𝑓)(𝑥).
21. Define Composite function. If 𝑓(𝑥) = 2𝑥, 𝑔(𝑥) = 𝑥 3 , ℎ(𝑥) = 𝑥 + 1, then
find (𝑓 ∘ 𝑔) ∘ ℎ and 𝑓 ∘ (𝑔 ∘ ℎ).
22. Define even and odd functions. Determine whether the 𝑓: 𝐼 → 𝑅 + defined by 𝑓(𝑥) = 2𝑥 + 7 is
one-to-one or bijective.
23. Find the domain of the function 𝑓(𝑥) = √81 − 𝑥 2 .
24. Show that the function 𝑓: 𝑅 → 𝑅 + ∪ {0} defined by 𝑓(𝑥) = |𝑥| is not invertible. Modify the
domain or codomain of 𝑓 so that it becomes invertible.