JNTU
JNTU B.Tech II DISCRETE MATHEMATICS Previous Question Paper (February - 2024 - R22)
Note: This question paper contains two parts A and B.
i) Part- A for 10 marks, ii) Part - B for 50 marks.
Part-A is a compulsory question which consists of ten sub-questions from all units carrying equal marks.
Part-B consists of ten questions (numbered from 2 to 11) carrying 10 marks each. From each unit, there are two questions and the student should answer one of them. Hence, the student should answer five questions from Part-B.
PART - A
Write the following statement in symbolic form: “the crop will be destroyed if there is a flood”.
Answer
Let p be "there is a flood" and q be "the crop will be destroyed". The symbolic form is p → q.
Write the following statement in symbolic form: All the first year students know C Programming. Manisha is a first year student.
Answer
Let F(x) be "x is a first year student" and C(x) be "x knows C Programming". Let m represent Manisha. The statements are: ∀x(F(x) → C(x)) and F(m).
Define power set.
Answer
Sign in to view the complete answer paper.
Prove that
Answer
Sign in to view the complete answer paper.
State modular lattice.
Answer
Sign in to view the complete answer paper.
State monoid homomorphism.
Answer
Sign in to view the complete answer paper.
How many ways can we draw a club and a diamond from a pack of cards?
Answer
Sign in to view the complete answer paper.
Find the number of non-negative integral solutions to
Answer
Sign in to view the complete answer paper.
Does there exist an Eulerian graph with an even number of vertices and an odd number of edges.
Answer
Sign in to view the complete answer paper.
Show that a simple connected planar graph with 17 edges and 10 vertices cannot be colored with 2-colors.
Answer
Sign in to view the complete answer paper.
PART - B
Construct truth table for the following
Answer
Sign in to view the complete answer paper.
Show that
Answer
Sign in to view the complete answer paper.
Obtain PCNF and PDNF for the following formula
Answer
Sign in to view the complete answer paper.
Show that
Answer
Sign in to view the complete answer paper.
If
Answer
Sign in to view the complete answer paper.
Let
Answer
Sign in to view the complete answer paper.
Construct an OR gate using three NAND gates.
Answer
Sign in to view the complete answer paper.
Describe a gating network corresponding to the statement
Answer
Sign in to view the complete answer paper.
Prove that
Answer
Sign in to view the complete answer paper.
If
Answer
Sign in to view the complete answer paper.
Find the 10th term of
Answer
Sign in to view the complete answer paper.
Show that
Answer
Sign in to view the complete answer paper.
Determine the co-efficient of
Answer
Sign in to view the complete answer paper.
Prove that
Answer
Sign in to view the complete answer paper.
State and prove fundamental theorem of graph theory.
Answer
Sign in to view the complete answer paper.
Let T be a tree with α vertices of degree 1 and β other vertices. Show that the sum of the degrees of the vertices of degree greater than 1 is α + 2(β - 1).
Answer
Sign in to view the complete answer paper.
Determine the maximum number of edges in a simple graph with n vertices and k components.
Answer
Sign in to view the complete answer paper.
State and Prove Euler's theorem for planar graphs.
Answer
Sign in to view the complete answer paper.