lOMoARcPSD|28630753

Question Bank
Discrete Structures &Theory of Logic
(BCS-303)

UNIT-1
1. Find the Maximal elements and minimal elements form the following Hasse’s diagram

2. Let A = { Φ, b}, then calculate A  P(A), where P(A) is a power set of A.

3. 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}
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. Differentiate complemented lattice and distributed lattice
6. State De Morgan’s law and Absorption Law.
7. 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) }
8. Solve the following recurrence relation by using generating function. an + 5an-1 + 6an-
2= 42. 4n , where a0 = 1 and a1 = -2
9. 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.
10. 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.

Downloaded by DKTECH ([email protected])

 lOMoARcPSD|28630753

UNIT-2
1) Find the composite mapping gof if f: R->R is given by f(x) = ex and g: R->R is
given by g(x) = sin x.
2) Explain Big-Omega notation with example and graphical representation. Define F
: R * R -> R * R by the rule F(x , y) = (x + y , x – y ) for all (x , y) ϵ R * R. Is F a
one-to-one correspondence? Prove or give a counter-example.
3) 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). Also explain the Axioms and Theorem of
Boolean algebra.
4) Solve the following recurrence relation by using generating function. an + 5an-1 +
6an-2= 42. 4n , where a0 = 1 and a1 = -2, Also explain the growth of function.
5) Define F : R * R -> R * R by the rule F(x , y) = (x + y , x – y ) for all (x , y) ϵ R *
R. Is F a one-to-one correspondence? Prove or give a counter-example.
6) Solve E(x,y,z,t) = ∑ (0,2,6,8,10,12,14,15) using K-map.
7) If f : R → R, g : R → R and h : R → R defined by
f(x) = 3x2 +2, g(x) = 7x – 5 and h(x) = 1/x.Compute the following composition
functions

i (fogoh)(x)

ii.(gog)(x)

iii.(goh)(x)

iv.(hogof)(x)

8) 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.
9) What are the recursive functions? Give the recursive definition of factorial
function.
10) Explain Growth of Functions with suitable examples.

11) Use generating function to find the number of ways Rs 23 can by paid by using 4
coins of Rs 5, 6 coins of Rs 2 and 4 coins of Rs 1.
12) 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.
13) Let R = {(1,2) (2,3) (3,1)} defined on A = {1,2,3}. Find the transitive closure of R
using Warshall’s algorithm. ii) 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”.

Downloaded by DKTECH ([email protected])

 lOMoARcPSD|28630753

UNIT-3
1) Is (p → q) → [(p → q) → q] a tautology? Why or why not?
2) Show that [(p ∨ q) ∧ (r ∨¬q)] → (p ∨ r)] is a tautology by making a truth table, and then
again by using an argument that considers the two cases “q is true” and “q is false”.
3) (a) Use any method to show that ¬(p → q) ↔ (p ∧¬q) is a tautology.
(b) Use known logical equivalences to show that ¬(p ↔ q) ⇔ (p ∨ q) ∧ (¬p ∨¬q).
4) Use known logical equivalences to do each of the following.
(a) Show p → (q ∨ r) ⇔ (p ∧¬q) → r. (b) Show ¬(p ∨ q) ∨ (¬p ∧ q) ∨¬(¬p ∨¬q)
⇔¬(p ∧¬q). (c) Find an expression logically equivalent to ¬(p ↔ q) that
involves only ¬ and ∨.
5) Construct the truth table for the following statements:
i)(P→Q’)→P’ ii)P↔(P’˅Q’).

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 life saving demonstration will go on.” (ii) “If
the sailing race is held, then the
trophywillbeawarded.”(iii)“Thetrophywasnotawarded.”implytheconclusion(iv)“Itrained.”

7) Justify that the following premises are inconsistent.(i)If Nirmala misses many classes
through illness then he fails high school.(ii)If Nirmala fails high school, then he is
uneducated.(iii) If Nirmala reads a lot of books
thenheisnotuneducated.(iv)Nirmalamissesmanyclassesthroughillnessandreadsalotofbooks.

8) Write the argument below in symbolic form.

If the argument is valid, prove it. If the argument is not valid, give a counterexample: If I watch
football, then I don’t do mathematics If I do mathematics, then I watch hockey . If I don’t watch
hockey, then I watch football.

9 ) (a) Show that p → (q → r) is logically equivalent to (p ∧ q) → r.

(b) Establish the validity of the argument

u→r
(r ∧ s) → (p ∨ t)
q → (u ∧ s)
¬t
q
p

10).Translate the following sentences in quantified expressions

of predicate logic.

Downloaded by DKTECH ([email protected])

 lOMoARcPSD|28630753

i) All students need financial aid.

ii) Some cows are not white..
iii) Suresh will get if division if and only if he gets first div.
iv) If water is hot, the n shyam will swim in pool.
v) All integer are either even or odd integer.

UNIT-4
1) Define the binary operation * on Z by x*y=x + y + 1 for all x,y belongs to a set of
integers. Verify that (Z,*) is an abelian group? Discuss the properties of the abelian
group.
2) Explain the following by suitable examples:
i. Permutation group
ii. Cosets
iii. Ring
iv. Field
3) Define normal subgroup.
4) Show that the set of all positive rational numbers forms an abelian group under the
composition defined by a * b = ab/4.
5) Describe cosets of a subgroup? Consider the group Z of integers under addition and the
subgroup H = {...., -12, -6, 0, 6 12, ......} considering of multiple of 6.
i. Find the cosets of H in Z.
ii. What is the index of H in Z?
6) State and prove Lagrange theorem.
7) In a group (G, *) prove that,
i. (a-1)-1=a
ii. (ab)-1=b-1a-1
8) Explain normal subgroup with suitable example.
9) Prove that a subgroup N of a group G is normal if and only if xN xˉ¹ = N, ∀x ∈ G.
10) Let Z be the group of integers with binary operation * defined
by a*b= a + b −2, for all a, b ∈ Z . Find the identity element of the group (Z,*)
11). Prove that set of complex numbers {1,-1,i,-i} under multiplication is an abelian group or
not where i is square root of (-1).

UNIT-5
1. 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.
iv. Bipartite graph.
V Handshaking theorem.

2. i. Justifythat“Inaundirectedgraphthetotalnumberofodddegreeverticesiseven”.

Downloaded by DKTECH ([email protected])

 lOMoARcPSD|28630753

ii. Justify that “The maximum number of edges in a simple graph isn(n-1)/2”.

3.Explain Euler’s formula. Determine number of regions if a planar graph has 30 vertices of
degree 3 each.

4.Explain pigeonhole principle with example.

5.Define the following with one example:

i) Bipartite graph.

ii) Complete graph.

iii) HowmanyedgesinK7andK3,6

iv) Planar Graph.

6. What are the degrees and what are the neighborhoods of the vertices in the graphs G and H

displayed in.

7. For which values of n do these graphs have an Euler path but no Euler circuit?

Kn ii. Cn iii. Wn iv.Qn

8. Are the graphs G and H displayed in bipartite?

Downloaded by DKTECH ([email protected])

 lOMoARcPSD|28630753

9.What are the chromatic numbers of the graphs G and H.

10. How many cards must be selected from a standard deck of 52 cards to
guarantee that at least three cards of the same suit are chosen?

Downloaded by DKTECH ([email protected])