Question Bank

Course Name & Code: DSTL (BCS 303)

Faculty Name: AJAY NANDAN SRIVASTAVA

LONG ANSWER TYPE QUESTIONS

UNIT 1
1. Let 𝐴 = 𝑅 × 𝑅 (R be the set of real numbers) and define the following relation on A.
(𝑎, 𝑏)𝑅(𝑐, 𝑑) ⇒ 𝑎2 + 𝑏 2 = 𝑐 2 + 𝑑 2 Verify that (A, R) is an equivalence relation.
2. Let X = {1, 2, 3... 7) and R = {(x, y): (x − y) is divisible by 3). Show that R is an equivalence
relation.
3. Let A = {a, b} and R = {(a, a), (b, a), (b, b)}, S = {(a, b), (b, a), (b, b)}:
Then, verify (𝑆𝑜𝑅) = 𝑅 −1 𝑜𝑆 −1
4. Justify for any sets A, B and C:
(i) (A − (A ∩ B)) = A − B
(ii) (A − (B ∩ C)) = (A − B) ∪ (A − C)
5. Construct the Hasse Diagram for (P(S), ⊆) where P(S) is a power set defined on set
S = {a, b, c}. Determine whether it is a Lattice or not.
6. Show that (D42, /) is lattice. Compare the distributive and complemented lattice with
example.
7. Prove that in any lattice the following distributive inequalities hold:
(𝑖) 𝑎 ∧ (𝑏 ∨ 𝑐) ≥ (𝑎 ∧ 𝑏) ∨ (𝑎 ∧ 𝑐), (𝑖𝑖) 𝑎 ∨ (𝑏 ∧ 𝑐) ≤ (𝑎 ∨ 𝑏) ∧ (𝑎 ∨ 𝑐)
8. Define Modular Lattice. Justify that if ‘a’ and ‘b’ are the elements in a bounded
distributive lattice and if ‘a’ has complement a′.
Then I) a ˅ (a′˄ b) =a˅ b II ) a˄ (a′˅ b)=a˄ b

1
 UNIT 2
9. Solve the following Boolean expressions using Boolean algebra
(i) xy + x ′ z + yz, (ii) C(B + C)(A + B + C),
10. Solve the following Boolean expressions using Boolean algebra

(iii) A + B(A + B) + A(A′ + B), (iv) XY + (XZ)′ + XY′Z(XY + Z)

11. Justify that “If f: A→B and g: B→C be one-to-one onto functions, then gof is also one to
one onto and (gof)-1= f -1o g -1”.
12. What is the simplified sum of product form for the Boolean expression: (A + B’ + C’) (A
+ B’ + C) (A + B + C’)

13. If f: R → R, g: : R → R and h: R → R defined by f(x) = 3x 2 + 2, g(x) = 7x −

1
5 and h(x) = then find:
x

(i) (fogoh)(x) (ii) (gog)(x) (iii) (goh)(x) (iv)(hogof)(x)

14. Let f: R→ 𝑅, 𝑔: 𝑅 → 𝑅, where R is the set of real numbers be given by f(x) = 𝑥 2 − 2 and
g(x) = x+4 find fog and gof. State whether these functions are bijective or not.
15. Define the following: (a) Recursive function (b) Injective function (c) Bijective function.
16. Solve the following Boolean functions using K-map:
(i) F (A, B, C, D) = Σ (m0,m1,m2,m4,m5,m6,m8,m9,m12,m13,m14)
(ii) F (A, B, C, D) = Σ (0,2,5,7,8,10,13,15)

UNIT 3
17. (i) Show that the propositions p→ q and ∼ p ∨ q are logically equivalent.
(ii) Show that ~(p ∨ q) and ~p ∧∼ q are logically equivalent.
18. Use rules of inference to show that the hypotheses If it does not rain or if it is not foggy,then
the sailing race will be held and the lifesaving demonstration will go on, If the sailingrace
is held, then the trophy will be awarded, and The trophy was not awarded imply the
conclusion It rained.
19. Show that the following premises are inconsistent.
a. If Jack misses many classes through illness, then he fails high school.
b. If Jack fails high school, then he is uneducated

2
 c. If Jack reads a lot of books, then he is not uneducated.
Jack misses many classes through illness and reads a lot of books.
20. Is (p∨ q) ∧ (∼ p ∨ r) → (q ∨ r) tautology, contradiction or contingency?

21. Let K(x):x is man , L(x):x is mortal

M(x): x is an integer, N(x): either positive or negative

Express the following using quantifiers:

(i)All men are mortal (ii)Any integer is either positive or negative

22. Let K(x): x is student, M(x): x is clever, N(x): x is successful

Express the following using quantifiers
(i)There exists a student

(ii)Some students are clever

(iii)Some students are not successful

23. Explain various Rules of Inference for Propositional logic.

24. (i) Construct the truth table for the following statement: (p→ q)→ p
(ii) Construct the truth table for the following statement: p↔ (p ∨ q).

UNIT 4
25. Justify that “if a, b is the arbitrary elements of a group G then (ab)2 = a2 b2 if and only if
G is abelian.
26. Show that “The intersection of any two normal subgroup of a group (G,∗) is again a
subgroup of (G,∗)”.
27. Define the Binary operation ∗ on Z by x ∗ y = x + y + 1 for all x, y belongs to set of
integers. Verify that (Z,∗ ) is abelian group? Discuss the properties of abelian group.
28. Let H be a subgroup of finite group G. Prove that order of H is an order of divisor of G.
(Lagrange’s theorem)
29. Let G = {1, −1, i, −i}with the binary operation multiplication be an algebraic structure,
where i = √-1. Determine whether G is an Abelian or not.
30. Write the properties of the Group. Show that the set (1, 2, 3, 4, 5) is not group under
addition and multiplication modulo 6.

3
31. What do you mean by the cosets of subgroup? Consider the group Z of integers under
addition and the subgroup 𝐻 = {… . . , −12, −6, 0, 6,12, … … . }considering of multiple 6.
Find the cosets of H in Z.
32. Describe Ring & Field.

UNIT 5
33. Explain Pigeon hole principle. Describe generalized form of Pigeon hole principle. If 6
colours are to paint 37 homes. Show that at least 7 of them will be of same colour.
34. If a connected planar graph G has n vertices, e edges and r region, then 𝑛 − 𝑒 + 𝑟 = 2.
Also show that:
(i) If a plane graph has k components, then 𝑛 − 𝑒 + 𝑟 = 𝑘 + 1.
(ii)If G is connected simple planar graph with 𝑛 ≥ 3 vertices and e edges, then 𝑒 ≤ 3𝑛 −
6
(iii)If G is connected simple planar graph with 𝑛 ≥ 3 vertices and e edges and no circuits
of length 3, then 𝑒 ≤ 2𝑛 − 4.
35. Show that the degree of a vertex of simple graph G on n vertices cannot exceed 𝑛 − 1.
𝑛(𝑛−1)
36. Show that the maximum number of edges in a simple graph with n vertices is .
2

37. Prove Handshaking theorem.

38. Compare bipartite and complete graph with example. Draw K3,4 and K5. Explain why
these two graphs are not planar.
39. Express the following
(i) Euler graph and Hamiltonian graph (ii) Chromatic number of a graph
(iii) Walk and path (iv) Bipartite graph

40. Explain the following terms with example:

i. Graph coloring and chromatic number. ii. How many edges in K7 and K3,3

iii. Isomorphic Graph and Hamiltonian graph.

4
 SHORT ANSWER TYPE QUESTIONS

UNIT 1
1. Differentiate complemented lattice and distributed lattice.
2. Draw the Hasse diagram of (A, ≤)where A = (3,4,12,24,48,72) and relation ≤ be such
that if a divides b.
3. Draw the Hasse diagram of D30, D36 .
4. Define modular lattice. Show that every Distributive lattice is modular.
5. State anti-symmetric and reflexive relation.
6. If R is a relation on the set A={ 1,2,3,4} defined by x R y if x exactly divides y .Prove that
(A,R) is a poset.
7. Give an example of relation which is symmetric but neither reflexive nor anti symmetric
nor transitive.

UNIT 2

8. Check whether the function f(x) = x2 - 1 is injective or not for f: R→R.

9. Define what is Big-O notation with respect of growth of functions.
10. Define ceiling function and identity function.
11. Express E(x, y, z) = xy+ yꞌz into its complete sum-of-products form.
12. Find the composite mapping gof if f: R→ 𝑅 is given by f(x) = ex and g: R→ 𝑅 is given by
g(x) = sinx.
13. Define Boolean function.
14. Check whether AC + ABC = AC is true or false?

UNIT 3
15. What is a tautology, contradiction and contingency?
16. Write the negation of the following statement:
“If I wake up early in the morning, then I will be healthy.”
17. Translate the conditional statement “if it rains, then I will stay at home” into contrapositive,
converse and inverse statement.
18. State Universal Modus Ponens and Universal Modus Tollens laws.
5
19. Construct inverse of the following statement “If I wake up early in the morning, then I
will be healthy.”
20. Express Converse, Inverse and Contrapositive of the following statement “If x+5=8 then
x=3”
21. Define quantifiers.
22. Explain conjunction, disjunction and conditional statements.

UNIT 4
23. Define Group.
24. In a group (G,∗) prove that (a−1 )−1 = a
25. In a group (G,∗) prove that (ab)−1 = b−1 a−1
26. Find order of each element of the following groups:
(i) G = {1, −1, i, −i} (ii) G = {1, ω, ω2 }
27. Prove that every cyclic group is abelian.
28. Define normal subgroup.
29. Prove that identity and inverse elements of a group is unique.

UNIT 5
30. Compare Euler circuit and Hamiltonian circuit.
31. Define complete and regular graph.
32. Define chromatic number.
33. What is Pigeonhole principal?
34. Describe Planar graph and express Euler’s formula for planar graph
35. Justify that “In a undirected graph the total number of odd degree vertices is even”.
36. Explain Euler’s formula. Determine number of regions if a planar graph has 30 vertices
of degree 3 each.