Scribd
Upload
2 views

FAT Model Paper

Uploaded by

aniketvyavahare89301
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

FAT Model Paper

Uploaded by

aniketvyavahare89301
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

SCHOOL OF ADVANCED SCIENCES

Fall Semester 2024-2025


Final Assessment Test Model Paper

Programme Name & Branch: B. Tech.


Course Name & Code: Discrete Mathematics and Graph Theory & BMAT205L
Exam Duration: 3 hrs.
Maximum Marks: 100

1 10 CO1 BL3
Obtain the principal disjunctive normal form of the following statement:

(p → (q ∧ r)) ∧ (∼ p → (∼ q∧ ∼ r))

and hence find the principal conjunctive normal form of the expression.

2 5+5 CO1 BL2


i) Verify the validity of the following argument:

1) Every living thing is a plant or an animal.

2) Arjun’s dog is alive and it is not a plant.

3) All animals have hearts.

4) Therefore Arjun’s dog has a heart.

ii) Show that

∀x : (P (x) ∨ Q(x)) =⇒ ((∀x : P (x)) ∨ (∃x : Q(x)))

by using the indirect method of proof.

3 10 CO2 BL3
Let a ∗ b = a + b + ab for all a, b ∈ G. Then check that if the structure
(G, ∗) is a commutative group, when G is the set of real numbers.

4 10 CO2 BL1
If H1 , H2 are two subgroups of a group G, then prove that H1 ∩ H2 is a
subgroup of G. Can we conclude that H1 ∪ H2 is also a subgroup of G?
Explain with an examples
5 10 CO3 BL3
Use generating function to solve the recurrence relation:

an+1 − 8an + 16an−1 = 4n, n ≥ 1

given that a0 = 1, a1 = 8.
6 10 CO4 BL1/BL2
Show that every chain is a distributive lattice. Also discuss about the converse
of this statement with justification.

(OR)
L
Expand the Boolean expression (x1 x2 ) into an equivalent sum-of-products
and product-of-sums canonical forms in terms of three variables x1 , x2 and x3 .

7 10 CO5 BL3
Use Dijkstra algorithm to find the shortest path between A and H in the
weighted graph shown in the figure.

8 10 CO5 BL1
Prove that a given connected graph G is an Euler graph if and only if all
vertices of G are of even degree.
9 10 CO5 BL1/BL2
Explain Kruskal algorithm, and then find the minimum spanning tree of the
following graph by using the algorithm.

(OR)

(a) Prove that a graph G is connected if and only if it has a spanning tree.
(b) A tree T has 2k vertices of degree 1, 3k vertices of degree 2 and k vertices
of degree 3. Determine the number of vertices and edges in T .
10 10 CO5 BL3
Find the chromatic number and chromatic polynomial of the following graph.

You might also like