Question Bank

Unit-1 (Set, Poset, Lattice)

1. Let A = {Φ, b}, then calculate A∪P(A), where P(A) is a power set of A.
2. Draw the Hasse’s diagram of the POSET (L ⊆), where, L = {S0, S1, S2, S3, S4, S5, S6, S7},
where the sets are given by S0 = {a,b,c,d,e,f}, S1 = {a,b,c,d,e} , S2 = {a,b,c,e,f}, S3 =
{a,b,c,e}, S4 = {a,b,c} , S5 = {a,b} , S6 = {a,c} , S7 = {a}.
3. Identify whether the each of the following relations defined on the set X = {1,2,3,4} are
reflexive, symmetric, transitive and/or antisymmetric?
(i) R1 = {(1,1), (1,2), (2,1)}
(ii) R2 = {(1,1), (1,2), (1,4), (2,1), (2,2), (3,3), (4,1), (4,4)}
(iii) R3 = {(2,1), (3,1), (3,2), (4,1), (4,2), (4,3)}
4. Let A = {1,2,3,4,5,6} be the set and R = {(1,1) (1,5) (2,2) (2,3) (2,6) (3,2), (3,3,) (3,6) (4,4)
(5,1) (5,5) (6,2) (6,3) (6,6)} be the relation defined on set A. Find Equivalence classes
induced by R.
5. Justify that for any sets A, B, and C:
(i) (A – (A ∩ B)) = A – B
(ii) (A – (B ∩ C)) = (A – B) ᴜ (A – C)
6. Let R = {(1,2) (2,3) (3,1)} defined on A = {1,2,3}. Find the transitive closure of R.
7. State Principle of Duality. Let A denote the set of real numbers and a relation R is defined on
A such that (a,b)R(c,d) if and only if a2 + b2 = c2 +d2. Justify that R is an equivalence
relation.
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
9. Justify that (D36, /) is lattice.
10. Let L1 be the lattice defined as D6 and L2 be the lattice (P(S), ≤), where P(S) be the power
set defined on set S= {a, b}. Justify that the two lattices are isomorphic.
11. Let R be a relation on set A with cardinality n. Write down the number of reflexive and
symmetric relation on set A.
12. Let A = {1, 2, 3, 4, 6, 8, 9, 12, 18, 24} be ordered by the relation ‘a divides b’. Find the
Hasse diagram.
13. If L be a lattice, then for every a and b in L prove that a ˄ b = a if and only if a ≤ b.
15. Prove that in any lattice the following distributive inequalities hold
(i) a ˄ (b ˅ c) ≥ (a ˄ b) ˅ (a ˄ c)
(ii) a ˅ (b ˄ c) ≤ (a ˅ b) ˄ (a ˅ c)
17. Define Distributive Lattice. In a distributive lattice (L, ≤) if any element has a compliment,
then this is unique.
18. Define Complete Lattice, Complemented Lattice and Modular Lattice.
19. Let A= (2, 4, 5, 7, 8) and relation R defined as aRb if and only if a+b≤12. Find relation
matrix. Let A= {1,2,3,4} and R= {(1,2), (4,3), (2,2), (2,1), (3,1)} is a relation defined on A. Find
the transitive closure of R.
20. In a competition, a school awarded medals in different categories. 36 medals in dance, 12
medals in dramatics and 18 medals in music. If these medals went to a total of 45 persons and
only 3 persons got medals in all the three categories, how many received medals in
exactly two of these categories?
Unit-2 (Functions and Boolean Function)
1. Define various types of functions.
2. Prove that a lattice with 5 elements is not Boolean Algebra.
3. Find the composite mapping gof if f: R→R is given by f(x) = ex and g: R→R is given by
g(x)= sinx
4. Let a function is defined as f: R- {3} → R- {1}, f(x) = (x-1)/(x-3), then show that f is a
bijective function and also compute the inverse of f. Where R is a set of real numbers.
5. 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)
6. Define Boolean algebra. Show that a’. [(b’+c)’+ b.c] + [(a+b’)’.c] = a’.b using rules of
Boolean Algebra. Where a’ is the complement of an element a.
7. If f: A→B, g: B→C are invertible functions, then show that g o f: A → C is invertible and (g
o f)-1 = f -1o g-1.
8. Determine whether each of these functions is a bijective from R to R.
(i) f(x) = x² +1
(ii) f(x) = x³
(iii) f(x) = (x² + 1)/ (x² +2)
9. Solve E(x,y,z,t)=Σ(0,2,6,8,10,12,14,15) using K-map.
10. Simplify the following Boolean function using K-map: F(x,y,z)=∑(0,2,3,7)
11. Solve E(x,y,z,t) = ∑ (0,2,6,8,10,12,14,15) using K-map.
12. Solve the following Boolean function using k map:
F (A, B, C, D) =Σ (m0, m1, m2, m4, m5, m6, m8, m9, m12, m13, m14)
13. Using Boolean identities, reduce the given Boolean expression
F (X, Y, Z) = X′Y + YZ′ + YZ + XY′Z′
14. 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-1 o g-1.
15. If f: R → R, g: R → R and h: R → R defined by f(x) = 3x 2 +2, g(x) = 7x – 5 and h(x) = 1/x.
16. Compute the following composition functions
(i) (fogoh)(x)
(ii) (gog)(x)
(iii) (goh)(x)
(iv) (hogof)(x)
17. Define various type of functions.
18. Check whether the function f(x) = x2 - 1 is injective or not for f: R→R.
19. Let A=R- {-1/2} and B= R- {1/2}. Let f: A→B be defined by f(x)=(x-3)/(2x+1). Show that f
is one -one and onto. Find a formula that defines f -1.
20. Define Boolean Algebra. Find the dual of the following Boolean expressions
(i) x’yz’+x’y’z
(ii) x(y’z’+yz)
(iii) xy(y+y’z) +x’z
Unit -3 (Propositional and Predicate Logic)
1. Construct the truth table for the following and state that whether it is a tautology,
contradiction or contingency?
(i) (p Λ q) → (p V q)
(ii) (P ↔ ¬ Q) Λ (P → ¬ R)
2. Define tautology, contradiction and contingency? Check whether (p ˅ q) ˄ (~ p ˅ r) → (q ˅
r) is a tautology, contradiction or contingency.
3. “If the labour market is perfect then the wages of all persons in a particular employment will be equal.
But it is always the case that wages for such persons are not equal therefore the labour market is not
perfect”. Test the validity of this argument using truth table.
4. What are quantifiers in logic? Differentiate between universal and existential quantifiers with suitable
examples.
5. Explain the following terms with suitable example:
(i) Conjunction
(ii) Disjunction
(iii) Conditional
(iv) Convers
(v) Contrapositive
6. Use rules of inference to Justify that the three hypotheses
(i) “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.”
(ii) “If the sailing race is held, then the trophy will be awarded.”
(iii) “The trophy was not awarded.” imply the conclusion (iv) “It rained.”

7. Consider the following conditional statement: If the flood destroys my house or the fires
destroy my house, then my insurance company will pay me. Write the converse, inverse and
contrapositive of the statement.
8. Express negations of the following sentences:
(i) (∀x) ( 𝑥 > x)
(ii) (∃𝑥) (𝑥 = 2)
9. State Universal Modus Ponens and Universal Modus Tollens laws.
10. Prove the validity of the following argument “If I get the job and work hard, then I will get promoted.
If I get promoted, then I will be happy. I will not be happy. Therefore, either I will not get the job, or I
will not work hard.”
11. Write a Short note on
(i) First order logic
(ii) Quantifiers
(iii) Valid arguments
12. What is a tautology, contradiction and contingency? Show that (p ∨ q) ∨ (¬ p ∨ r) → (q ∨ r) is a
tautology, contradiction or contingency.
13. Show that: (r → ~ q, r ∨ S, S → ~ q, p → q) ↔ ~ p is inconsistent.
14. Explain tautologies, contradictions, Satisfiability and contingency
15. Show that ((p ∨ q) ∧ ~ (~p ∧ (~q ∨ ~r))) ∨ (~p ∧ ~q) ∨ (~ p ∨ r) is a tautology without using truth
table.
16. Write the symbolic form and negate the following statements:
(i) Everyone who is healthy can do all kinds of work.
(ii) Some people are not admired by everyone.
(iii) Everyone should help his neighbours, or his neighbours will not help him.
17. Show that ((p ∨ q) ∧ ~ (~p ∧ (~q ∨ ~r))) ∨ (~p ∧ ~q) ∨ (~ p ∨ r) is a tautology without using truth
table.
18. If this number is divisible by 6, then it is divisible by 3. This number is not divisible by 3 therefore
this no is not divisible by 6. Cheek Validity.
19. Transform logically to “Not all Rainy day are cold”.
20. Translate the conditional statement “If it rains, then I will stay at home” into contra positive, converse
and inverse statement.
Unit – 4 (Group Theory)
1. Differentiate between semigroup and subgroup with example.
2. Define a group. Let S = {0, 1, 2, 3, 4, 5, 6, 7} & * denote “multiplication modulo 8”. Show that (S,
*) is a group.
3. Let G be the set of all non-zero real numbers and let a*b= ab/2. Show that (G, *) is an abelian
group.
4. Show that G = {i, -I, 1, 1} where i = √−1, is an abelian group with respect to multiplication as a
binary operation.
5. 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.
6. If G1 and G2 be subgroup of a group G, G1∩ G2 is also a subgroup of G.

7. Show that the group {1,2,3,4,5,6} under addition module 7 is a cyclic group. How many generators
are there.
8. Define permutation group. With example.
9. State and justify “Every cyclic group is an abelian group”.
10. Let (G, *) and (G´, *´) be any two groups and let e and e´ be their respective identities. If f is a
homomorphism of G into G´, then prove that
(i) f(e) = e´
(ii) (ii) f(x) =f(x) -1 for all x € G
11. Prove necessary and sufficient condition for a subgroup of a group.
12. A subgroup H of a group G is normal if and only if g-1hg ∈H for every h∈H, g∈H.
13. Find the cycles of following permutation
14. Define normal subgroup.
15. Define ring and field.
16. If (R, +) is a ring with unity, then show that, for all a ∈ R.
 (i) (-1). a = -a
(ii) (-1). (-1) = 1
17. Justify the statement “the order of a subgroup H of a group is a divisor of the order of G”.
18. If a, b are the arbitrary elements of a group G then (ab)2 = a2b2 if and only if G is abelian.
19. Every cyclic group is an abelian group.
20. Prove that every group of prime order is cyclic group.

Unit – 5(Graph Theory).

1. Define complete and regular graph.

2. Define Euler’s formula. Determine number of regions if a planar graph has 30 vertices of degree 3
each.
3. What do you mean by graph isomorphism, show it by example?
4. Prove that the maximum number of edges in a simple graph with n vertices is n(n-1)/2.
5. Define Eulerian Graph and prove that a non-empty connected graph G is Eulerian iff its vertices are
all of even degree.
6. Differentiate between Eulerian graph & Hamiltonian graph with example.
7. Explain the Graph coloring and chromatic number with example.
8. How many edges in K7 and K3,3.
9. Explain the Isomorphic Graph and Hamiltonian graph.
10. Explain the Bipartite graph with example.
11. Explain pigeonhole principle with example.
12. Justify that “In an undirected graph the total number of odd degree vertices is even”.
13. Justify that “The maximum number of edges in a simple graph is n(n-1)/2”.
14. Explain the Handshaking theorem.
15. Explain the Walk and path.
16. Describe Planar graph and express Euler’s formula for planar graph.
17. Explain the Euler Graph with example.
18. Explain the Adjacency matrix of a graph.
19. Define the Complete graph with example.
20. Using Pigeonhole principle find the minimum number n of integers to be selected from S=
{1,2,3,4,5,6,7,8,9} so that
(i) The sum of two of the integers is even
(ii) The difference of two of the n integers is 5