Save as PDF
Opens your browser print dialog — select "Save as PDF" to download.
Total No. of Questions: 8
Total No. of Printed Pages: 04
Enrollment No.
IT-302
B.Tech. III Semester
Examination, December 2025
Grading System (GS)
Discrete Structure
Time: Three Hour
Maximum Marks: 70
Note: i. Attempt any five questions.
1 (a)
Find the number between 1 to 500 that are not divisible by any of the integers 2 or 3 or 7.
(b)
Prove that 52n-1 is divisible by 24, where is any positive integer.
2 (a)
What is mapping ? Explain types of mapping.
(b)
Define relation with example. Explain various types of representation of relation.
3 (a)
Prove that G = \{0, 1, 2, 3, 4, 5, 6} is an abelian group of order 7 with respect to addition modulo 7.
(b)
What is a Ring? Define elementary properties of ring with example.
4 (a)
Construct truth table of the following and prove:
(p→p∧r) → (~r → p) is a tautology
(p→p∧r) → (~r → p) is a tautology
(b)
(p∧q) ∧(~p) ∧(~q) is a contradiction.
5 (a)
Define and explain any four of the following with suitable example.
- Bipartite graph
- Hamiltonian path and circuit
- Chromatic number and graph coloring of graph
- Adjacency matrix of graph
- Binary search tree
(b)
Prove that F={a + b √2 | a, b rational} is a field.
6 (a)
Prove or disprove that intersection of two normal subgroups of a group G is again a normal subgroup of G. Define subgroup, normal subgroup, Quotient group, with an example for each.
(b)
Explain the following
- Euler Graph
- Isomorphic Graphs
- Minimal spanning tree
- Height of the tree
7
Define planner Graph. Prove that for any connected planner graph, v-e+r=2 where v,e,r is the number of vertices, edges, and region of the graph respectively.
8
Solve the following recurrence relation :
ar – 7ar-1 + 10ar-2 = 3r Given that a0=0, a1=1.
(b)
Solve the following recurrence relation using generating function
G(K)-7G(K-1)+10G(K-2)=8K+6
G(K)-7G(K-1)+10G(K-2)=8K+6
8 (a)
Discuss in brief any two of the following:
- Partial ordering relation
- Poset
- Disjunctive normal form
- Pigeonhole principle
(b)
Define the lattice. Let (L,≤,∨,∧) be a lattice and a,b,c,d∈L such that a≤b and c≤d. Show that a∨c≤b∨d and a∧c≤b∧d.