Scribd
Upload
450 views3 pages

DMGT Imp Questions

The document contains important questions divided into five units covering topics in mathematical logic, functions, combinatorics, recurrence relations, and graph theory. Each unit includes definitions, examples, and problems to solve, such as proving tautologies, defining bijective functions, and solving recurrence relations. The questions aim to assess understanding and application of various mathematical concepts.

Uploaded by

nandyalavenkateswara56
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
450 views3 pages

DMGT Imp Questions

The document contains important questions divided into five units covering topics in mathematical logic, functions, combinatorics, recurrence relations, and graph theory. Each unit includes definitions, examples, and problems to solve, such as proving tautologies, defining bijective functions, and solving recurrence relations. The questions aim to assess understanding and application of various mathematical concepts.

Uploaded by

nandyalavenkateswara56
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

DMGT IMPORTANT QUESTIONS

UNIT – I
1. Explain Basic connectives in mathematical logics?
2. Define tautology and contradiction? With examples?
3. Write done the rules of inference?
4. Define Quantifiers? With examples?
5. Show that (𝑃 ∨ 𝑄 ) ∧ ~ ~𝑃 ∧ (~𝑄 ∨ ~𝑅 ) 𝑉(~𝑃 ∧ ~𝑄 ) ∨
(~𝑃 ∧ ~𝑅 ) is a tautology?
6. Obtain PCNF and PDNF of(~𝑃 → 𝑅)Λ(𝑄 ↔ 𝑃)?
7. Show that 𝑆 ∨ 𝑅 is tautologically implied by (𝑃 ∨ 𝑄) ∧
(𝑃 → 𝑅 ) ∧ (𝑄 → 𝑆)
8. Show that the conclusion 𝐶 follows from the premises
𝐻 , 𝐻 & 𝐻 in following case
𝐻 : 𝑃 ∨ 𝑄 , 𝐻 : 𝑃 → 𝑅 , 𝐻 : 𝑄 → 𝑅 𝐶: 𝑅

Unit-II
1. Define bijective function? Give one example?
2. Explain Semi group? Give one example?
3. Let 𝐴 = {1,2,3} 𝑎𝑛𝑑 𝐵 = {1,2,3,4,5}. Show that the relation
𝑅 = {(1,1), (2,3), (3,4)} is a function.
4. Order of an element of a group?
5. Show that 𝐺 = {1, 𝜔, 𝜔 } is group under multiplication?
6. Let 𝑓(𝑥 ) = 𝑥 − 2, 𝑔(𝑥 ) = 𝑥 + 4 then find 𝑓𝑜𝑔, 𝑔𝑜𝑓 ? also
state whether this functions are bijective or not?
7. Prove that 𝑓: 𝑅 → 𝑅 then 𝑓(𝑥 ) = 4𝑥 − 5 is a bijective
function.
8. Draw the Hasse Diagram for (𝑃(𝑆), ⊑) where P(S) is the Power
set on 𝑆 = {𝑎, 𝑏, 𝑐}
Unit-III
1. Three persons enter into a car, where there are 5 seats. In how many ways
can they take up their seats?
2. State Binomial theorem and Multinomial theorem.
3. What is the coefficient of 𝑥 𝑦 in the expansion of (2𝑥 − 3𝑦) ?
4. Find the number of permutations that can had from the letters of the word
DAUGHTER (i) Beginning with D and ending with R, (ii) all vowels
being together.
5. How many ways are there to arrange the letters of the word (i)
ENGINEERING (ii) MATHEMATICS
6. In how many ways 5 boys and 4 girls can be seated at around table if (i)
all four girls sit together (ii) no two girls sit together
7. A Committee of 8 is to be formed from 16 men and 10 women. In how
many ways can the Committee be formed if an even number of women.
8. How many solutions are there 𝑥 + 𝑦 + 𝑧 = 17 subject to constaints 𝑥 ≥
1, 𝑦 ≥ 2 𝑎𝑛𝑑 𝑧 ≥ 3 ?

Unit-IV
1. Solve 𝑎 = 2𝑎 𝑓𝑜𝑟 𝑛 ≥ 1 𝑤𝑖𝑡ℎ 𝑎 = 1.
2. Define recurrence relation?
3. Define Generating function and give suitable example.
4. Solve 𝑎 = 𝑎 + 2𝑎
5. Solve the recurrence relation of the Fibonacci sequence of numbers
𝐹 =𝐹 + 𝐹 for 𝑛 ≥ 0 given that 𝐹 = 0, 𝐹 = 1.
6. Solve 𝑎 − 6𝑎 + 9𝑎 = 0, 𝑓𝑜𝑟 𝑛 ≥ 2 with intial conditions 𝑎 =
5, 𝑎 = 12.
7. Solve 𝑎 − 5𝑎 + 6𝑎 = 2 with intial conditions 𝑎 = 1, 𝑎 = −1.
8. Using the Generating functions, solve the recurrence relation 𝑦 +
4𝑦 + 4𝑦 = 0, 𝑦 = 0 𝑎𝑛𝑑 𝑦 = 2.

Unit-V
1. What is graph? How many types of graphs?
2. What is planar Graph? Give one Example?
3. Define Spanning Tree?
4. Define Trail and Circuit? Give one example?
5. Prove that the maximum and minimum number of edges graph with n
( )
vertices is ?
6. Prove that a Tree with n vertices had n-1 edges.
7. Show that the given pair of graphs are isomorphic.

G:

H:

8. Obtain minimum Spanning Tree of the following graph?

You might also like