DEPARTMENT OF APPLIED SCIENCES (M ATHEM ATICS)

Question Bank No. 3

Title of Co urse: Discrete Mathematics
Course Code: AM109
Topic Name: Lattice, Boolean Algebra, Logic Gates, Graph theory
LATTICE:
1. Complement of 14 in 𝐷42 is:
(i) 14 (ii) 3
(iii) 2 (iv) 7
2. Complement of 10 in 𝐷100 is:
(i) 10 (ii) 100
(iii) Does not exist (iv) 50
3. Every finite subset of a lattice has
(i) A l.u.b and g.l.b (ii) Many l.u.bs and many g.l.bs
(iii) Either some l.u.bs and some g.l.bs (iv) No l.u.b. or some g.l.bs
4. By De-Morgan’s law the value of 𝑎 ∨ 𝑏 is
(i) 𝑎∨𝑏 (ii) 𝑎∨𝑏
(iii) 𝒂𝜦𝒃 (iv) 𝑎𝛬𝑏
5. If 𝐷6 = 1,2,3,6 , be a lattice under divisibility. Then the complement of 6 is
(i) 1 (ii) 2
(iii) 3 (iv) 6
6. Consider the poset 𝐴 = 1,2,3,4,6,9,12,18,36 , / , then g.l.b. of sets 6,18 and 4,6,9 are
(i) 6, 1 (ii) 1, 1
(iii) 18, 36 (iv) 6, 9
7. A lattice is distributive iff
(i) 𝑎 ∨ 𝑏𝛬𝑐 = 𝑎𝛬 𝑏 ∨ 𝑐 (ii) 𝑎 ∨ 𝑏 ∨ 𝑐 = 𝑎 ∨ 𝑏𝛬𝑐
(iii) 𝑎 ∨ 𝑏𝛬𝑐 = 𝑎 ∨ 𝑏 ∨ 𝑎𝛬𝑐 (iv) 𝒂 ∨ 𝒃𝜦𝒄 = 𝒂 ∨ 𝒃 𝜦 𝒂 ∨ 𝒄
8. For the Poset 3,5,9,15,24,45 ,/ , the maximal element/elements is/are
(i) 45 (ii) 24
(iii) 24, 45 (iv) 3, 5
9. The factors of 12 under ………forms a lattice.
(i) Addition (ii) Subtraction
(iii) Divisibility (iv) Multiplication
10. Which of the following is a Lattice under relation of divisibility?
(i) A = {2, 3, 4, 12} (ii) B = {1, 2, 3, 9, 18}
(iii) C = {1, 2, 3, 6} (iv) D = {1, 2, 4, 5, 10}
11. Compliment of 4 & 6 in D12 is
1
DEPARTMENT OF APPLIED SCIENCES (M ATHEM ATICS)

(i) 3&2 (ii) does not exist & 2

does not exist for 4 & 6
(iii) 3 & does not exist (iv)

12. Consider a lattice D = { 1, 2, 3, 4, 6, 12}. Find the complement of 6 for this lattice

(i) No complement exists (ii) 2

(iii) 4 (iv) 12
13. Let D30 = {1, 2, 3, 4, 5, 6, 10, 15, 30} and relation ‘/’ be partial ordering on D30. The all
lower bounds of 10 and 15 respectively are
(i) 1, 3 (ii) 1, 3, 5
(iii) 1, 5 (iv) 3
14. Let D30 = {1, 2, 3, 4, 5, 6, 10, 15, 30} and relation ‘/’ be partial ordering on D30. L.u.b.
of 10 and 15 is
(i) 30 (ii) 15
(iii) 10 (iv) 6
15. A partial ordered relation is transitive, reflexive and _____________
(i) Anti-symmetric (ii) Symmetric
(iii) Asymmetric (iv) Neither symmetric nor anti-symmetric

BOOLEAN ALGEBRA
1. Which of the following formula is known as Domination law?
a 𝒑𝑽𝑻≡𝑻 b 𝑝Λ𝑇 ≡𝑝
c 𝑝𝑉𝐹 ≡𝑝 d 𝑝 𝑉 ~𝑝 ≡ 𝑇

2. 𝑝 𝑉 𝑞 𝑉 𝑟 ≡ 𝑝 𝑉 (𝑞 𝑉 𝑟) is known as
a Idempotent Law b Commutative Law
c Associative Law d Negation Law
3. If B is a Boolean Algebra, then which of the following is true?
a B is a finite but not complemented lattice b B is not distributive lattice
c B is a finite, complemented and distributive d B is a finite, distributive but not complemented
lattice lattice
4. Which of the examples given below expresses the distributive law of Boolean algebra?
a (x + y) + z = x + (y + z) b x + (y + z) = xy + xz
c x(y + z) = xy + xz d x(yz) = (xy) + z
5. By applying De-Morgan's theorem to the expression (XYZ)', we get
a X' + Y' + Z' b (X + Y + Z)'
c X + (YZ)' d X + Y +Z
6. On solving the expression Y = (a+c+d).(a+c+d').(a+c'+d).(a+d'), we get the value of Y as
a a'c' + a'cd' + a'd b A
c a'c' d a'

2
DEPARTMENT OF APPLIED SCIENCES (M ATHEM ATICS)

7. Which of the following expressions is in the sum-of-products i.e. SOP form?

a (A+B).(C+D) b AB + CD
c A.(BC).D d (A+B) + (C+D)
8. Which of the following is the standard sum-of-product (SOP) form of the Boolean expression A'B +
A'C
a A'B'C' + A'B'C + AB'C b A'B'C + A'BC' + A'BC
c A'B'C + AB'C + ABC' d A'B'C' + AB'C + A'BC'
9. Which of the following expressions always produces a logic 1
a A.A' b A+B
c A + A' d A.B'
10. Which of the following expressions represents the same Boolean function as (A + A'B):
a A + B' b A
c B d A+B
11. Applying De-Morgan's theorem to the expression [ (A + B + C).D ]'
a A'B'C'D' b (ABC)'.D
c ABC.D' d A'B'C' + D'
12. On simplifying the following Boolean expression abc + a'b'c + a'bc + a'b'c' becomes
a bc + a'b' b bc + ab
c b'c' + ab d None of these
13. What is the Boolean expression for a three input AND gate?
a A.B.C b A + B +C
c A'.B'.C' d None of these
GRAPH THEORY
1. The maximum degree of any vertex in a simple graph with n vertices is
a n-1 b n+1
c 2n-1 d N
2. In any undirected graph the sum of degrees of all the nodes
a Must be even b Is twice the number of edges
c Must be odd d Need not be even
3. A vertex of a graph is called even or odd depending upon
a Total number of edges in a graph is even or b Total number of vertices in a graph is even or
odd odd
c Its degree is even or odd d None of these
4. In an undirected graph the number of nodes with odd degree must be
a Zero b Odd
c Prime d Even
5. The complete graph with four vertices has k edges where k is
a 3 b 4
c 5 d 6
6. An edge associated with a vertex pair (v, v) is called a
a Vertex edge b Cycle edge
c Self loop d Circular edge
7. The number of edges incident on a vertex v is called the ……of v.

3
DEPARTMENT OF APPLIED SCIENCES (M ATHEM ATICS)

a Factor b Size
c Multiple d Degree
8. A graph is a collection of
a Row and columns b Vertices and edges
c Equations d None of these
9. The degree of any vertex of graph is
a The number of edges incident with that b Number of vertices in a graph
vertex
c Number of vertices adjacent to that vertex d Number of edges in a graph
10. If for some positive integer k, degree of vertex d(v)=k for every vertex v of the graph G, then G is
called
a K-Graph b K-regular Graph
c Empty graph d All of above
11. A graph with no edge is known as empty graph. Empty graph is also known as
a Trivial graph b Regular graph
c Bipartite graph d None of these
12. If the origin and terminus of a walk are same, the walk is known as
a Open b Closed
c Path d None of these
13. State whether true(T) or false(F) (i) A vertex of degree 1 is called a pendant vertex. (ii) A vertex
having no incident edge is called an isolated vertex.
a (i) T and (ii) T b (i) T and (ii) F
c (i) F and (ii) T d (i) F and (ii) F
14. State whether true(T) or false(F) (i) The sum of the degrees of the vertices of a graph G is thrice
the number of edges. (ii) The number of vertices of odd degree is always even.
a (i) T and (ii) T b (i) T and (ii) F
c (i) F and (ii) T d (i) F and (ii) F
15. A graph with one vertex and no edge is
a Multi graph b Digraph
c Isolated graph d Trivial graph
16. Suppose v is an isolated vertex in a graph, then the degree of v is
a 0 b 1
c 2 d 3
17. Every complete graph is
a Regular graph b Have loop
c Equal number of odd and even vertices d No odd vertex
18. Every regular graph with n vertices and of degree r has
𝑛 𝑟
a edges b edges
2 2
𝒏𝒓 𝑛−𝑟
c edges d edges
𝟐 2
19. The graph 𝐾𝑛 is planar iff
a 𝑛≤3 b 𝑛=3
c 𝒏≤𝟒 d 𝑛=4